DocumentCode :
1895732
Title :
Natural Computation for the Traveling Salesman Problem
Author :
Zhang, Jing
Author_Institution :
Beijing Union Univ., Beijing, China
Volume :
1
fYear :
2009
fDate :
10-11 Oct. 2009
Firstpage :
366
Lastpage :
369
Abstract :
The traveling salesman problem (TSP) is a classical combinatorial optimization problem of operations research´s area, which is simple to state. However, this problem is known to be NP-hard, and cannot be solved exactly in polynomial time. Therefore, it would seem to be an ideal candidate for nonstandard algorithmic approaches, such as natural computation. Natural computation is the computational version of the process of extracting ideas from nature to develop computational systems, those that take inspiration from nature for the development of novel problem-solving techniques. This paper is a survey of natural computation for the traveling salesman problem.
Keywords :
computational complexity; genetic algorithms; neural nets; travelling salesman problems; NP-hard problem; combinatorial optimization problem; computational system; natural computation; nonstandard algorithmic approaches; operations research; problem-solving techniques; traveling salesman problem; Ant colony optimization; Artificial neural networks; Cities and towns; Computer networks; DNA computing; Genetic algorithms; Neural networks; Problem-solving; Recurrent neural networks; Traveling salesman problems; Ant colony optimization; Artificial neural networks; Genetic algorithms; Natural computation; Traveling salesman problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Computation Technology and Automation, 2009. ICICTA '09. Second International Conference on
Conference_Location :
Changsha, Hunan
Print_ISBN :
978-0-7695-3804-4
Type :
conf
DOI :
10.1109/ICICTA.2009.96
Filename :
5287634
Link To Document :
بازگشت