TSP Ejection Chains

@article{Pesch1997TSPEC,
  title={TSP Ejection Chains},
  author={Erwin Pesch and Fred Glover},
  journal={Discrete Applied Mathematics},
  year={1997},
  volume={76},
  pages={165-181}
}
We identify ejection chain methods for the traveling salesman problem based on a special reference structure for generating constructions related to alternating paths. Computational tests show that the method performs very effectively, obtaining generally better solutions than improved versions of the Lin-Kemighan method within the same time frame. Our approach, which currently has a simple tabu search guidance component at a local level, also has the potential to be combined in more advanced… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem, Graduate School of Business, University of Colorado

  • F. Glover
  • 1991
Highly Influential
9 Excerpts

Ejection chains and graph-related applications, Graduate School of Business, University of Colorado

  • F. Glover, E. Pesch
  • 1995

Learning in Automated Manufacturing (Physica

  • E. Pesch
  • 1994

Solving vehicle routing problems using generalized assignments and tabu search, Graduate School of Business, IJniversity of Colorado

  • W. R. Stewart, J. P. Kelly, M. Laguna
  • 1994

Similar Papers

Loading similar papers…