DocumentCode
2040038
Title
Intelligent dynamic programming for the generalised travelling salesman problem
Author
Jellouli, Olfa
Author_Institution
Syst. Modeling & Dependability Lab., Univ. of Technol. of Troyes, France
Volume
4
fYear
2001
fDate
2001
Firstpage
2765
Abstract
We develop a method based on the simulated annealing and genetic algorithms to solve the travelling salesman problem (TSP) and the generalised TSP (GTSP) problem. These two problems are known to be NP-hard. The GTSP exist in many application fields
Keywords
computational complexity; dynamic programming; genetic algorithms; simulated annealing; travelling salesman problems; NP hard problem; dynamic programming; genetic algorithms; optimisation; simulated annealing; travelling salesman problem; Cost function; Dynamic programming; Genetic algorithms; Genetic mutations; Laboratories; Lagrangian functions; Modeling; Simulated annealing; Stochastic processes; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 2001 IEEE International Conference on
Conference_Location
Tucson, AZ
ISSN
1062-922X
Print_ISBN
0-7803-7087-2
Type
conf
DOI
10.1109/ICSMC.2001.972985
Filename
972985
Link To Document