New Insertion and Postoptimization Procedures for the Traveling Salesman Problem

Michel Gendreau, Alain Hertz, Gilbert Laporte

Operations Research · 1992 · Volume 40 · Issue 6

Abstract

This paper describes a new insertion procedure and a new postoptimization routine for the traveling salesman problem. The combination of the two methods results in an efficient algorithm ( GENIUS ) which outperforms known alternative heuristics in terms of solution quality and computing time.

Keywords

networks/graphs, traveling salesman: insertion and postoptimization procedures

Enable JavaScript for citation tools and additional paper interactions.