You are not currently logged in.
Access JSTOR through your library or other institution:
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
Michel Gendreau, Alain Hertz and Gilbert Laporte
Vol. 40, No. 6 (Nov. - Dec., 1992), pp. 1086-1094
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/171722
Page Count: 9
You can always find the topics here!Topics: Vertices, Tours, Heuristics, Algorithms, Cost efficiency, Traveling salesman problem, Mathematical problems, Tabu search, Capital costs, Closing costs
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
Operations Research © 1992 INFORMS