Advertisement

Further Heuristic Approaches

Chapter
  • 1.6k Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 840)

Abstract

Every TSP heuristic has, at least in principle, the chance to find an optimal tour. But, this is an almost impossible event. Usually, an improvement method only finds a locally optimal tour in the sense that, although the tour is not optimal, no further improving moves can be generated. The weaker the local moves that can be performed, the larger the difference between the length of an optimal tour and of the tour found by the heuristic. One way to obtain better performance is to start improvement heuristics many times with different starting tours, because this increases the chance of finding better local minima. Success is limited, though.

Keywords

Simulated Annealing Tabu Search Temperature Step Tabu List Annealing Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Personalised recommendations