Presentation	2002/3/15 A Solution for the Traveling Salesman Problem by Combining the Genetic Algorithm and Heuristics Shinji OMURO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	We propose a method for solving the Traveling Salesman Problem (TSP) by combining the genetic algorithm (GA) and heuristics. TSP in a typical combinatorial optimization problem. On the other hand, GA is an algorithm that in based on the analogy of biological evolution. It is known that GA is useful for the TSP, bet it becomes inefficient according to the increase of the number of cities. In this research, candidates for solutions are encoded by individuals and each individual has knowledge for efficient searching. As a result each individual evolves itself and the system realizes efficient searches us a whole. We compare our method with the conventional methods using the GA, and the validity of our method is verified.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Genetic Algorithm / Heuristics / Traveling Salesman Problem / Combinatorial Optimization Problem
Paper #
Date of Issue

Conference Information
Committee	AI
Conference Date	2002/3/15(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Artificial Intelligence and Knowledge-Based Processing (AI)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	A Solution for the Traveling Salesman Problem by Combining the Genetic Algorithm and Heuristics
Sub Title (in English)
Keyword(1)	Genetic Algorithm
Keyword(2)	Heuristics
Keyword(3)	Traveling Salesman Problem
Keyword(4)	Combinatorial Optimization Problem
1st Author's Name	Shinji OMURO
1st Author's Affiliation	Faculty of Systems Engineering, Wakayama University()
Date	2002/3/15
Paper #
Volume (vol)	vol.101
Number (no)	742
Page	pp.pp.-
#Pages	7
Date of Issue