Abstract
Many real world optimization problems are related with time and some of them can be modeled by the Dynamic TSP(DTSP). A DTSP is harder than a general TSP, which is a NP-hard problem, because the city number of the DTSP is time varying. In the paper, first give a mathematical model for DTSP. Then discuss the GT algorithm which is a algorithm solve static TSP problem. Based on GT algorithm, proposed an evolutionary algorithm, which can solve DTSP problem, give its detail describe, analyze its character and give a graph of CHN144+1 problem. At the end, conclude the paper and give the research area in future.
| Original language | English |
|---|---|
| Pages | 2271-2274 |
| Number of pages | 4 |
| State | Published - 2004 |
| Externally published | Yes |
| Event | WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings - Hangzhou, China Duration: 15 Jun 2004 → 19 Jun 2004 |
Conference
| Conference | WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings |
|---|---|
| Country/Territory | China |
| City | Hangzhou |
| Period | 15/06/04 → 19/06/04 |
Keywords
- Dynamic TSP
- Evolutionary algorithm
- Genetic algorithm
- TSP