A New Approach to Solving Dynamic Traveling Salesman Problems

The Traveling Salesman Problem (TSP) is one of the classic NP hard optimization problems. The Dynamic TSP (DTSP) is arguably even more difficult than general static TSP. Moreover the DTSP is widely applicable to real-world applications, arguably even more than its static equivalent. However its inve...

Full description

Saved in:
Bibliographic Details
Published inLecture notes in computer science pp. 236 - 243
Main Authors Li, Changhe, Yang, Ming, Kang, Lishan
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Exact sciences and technology
Gene Pool
Logistics
Minimum Span Tree
Operational research and scientific management
Operational research. Management science
Travel Salesman Problem
Vehicle Route Problem
Travelling salesman problem
Artificial intelligence
Optimization
NP hard problem
Online AccessGet full text

Cover

More Information
Summary:The Traveling Salesman Problem (TSP) is one of the classic NP hard optimization problems. The Dynamic TSP (DTSP) is arguably even more difficult than general static TSP. Moreover the DTSP is widely applicable to real-world applications, arguably even more than its static equivalent. However its investigation is only in the preliminary stages. There are many open questions to be investigated. This paper proposes an effective algorithm to solve DTSP. Experiments showed that this algorithm is effective, as it can find very high quality solutions using only a very short time step.
ISBN:9783540473312
3540473319
ISSN:0302-9743
1611-3349
DOI:10.1007/11903697_31