Dynamic traveling salesman problem based on evolutionary computation

Author

Huang, Zhang-can ; Hu, Xiao-Lin ; Chen, Si-Duo

Author_Institution

Dept. of Math., Wuhan Univ. of Technol., China

Volume

2

fYear

2001

fDate

2001

Firstpage

1283

Abstract

In the optimization process of some ordering problems, we compare them to the traveling salesman problem (TSP) and put forward the conception of a virtual map. Based on this conception, the problems are all put into the framework of the dynamic traveling salesman problem (DTSP). The paper makes a lot of comparisons between TSP and DTSP about their characteristics, and finds out the commonality and differences between them. At the same time, we consider that the presentation of DTSP conception is attributed to the rise of modern optimization methods founded on probability, and evolutionary computation is one of the best algorithms to solve DTSP nowadays

Keywords

evolutionary computation; probability; travelling salesman problems; DTSP conception; dynamic traveling salesman problem; evolutionary computation; optimization methods; optimization process; ordering problems; probability; virtual map; Automation; Automotive engineering; Circuits; Cities and towns; Costs; Evolutionary computation; Mathematics; Optimization methods; Traveling salesman problems; Vehicle dynamics;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2001. Proceedings of the 2001 Congress on

Conference_Location

Seoul

Print_ISBN

0-7803-6657-3

Type

conf

DOI

10.1109/CEC.2001.934338

Filename

934338