New Insertion and Postoptimization Procedures for the Traveling Salesman Problem

Michel Gendreau, Alain Hertz and Gilbert Laporte
Additional contact information
Michel Gendreau: University of Montreal, Montreal, Canada
Alain Hertz: École Polytechnique Fédérale de Lausanne, Switzerland
Gilbert Laporte: University of Montreal, Montreal, Canada

Operations Research, 1992, vol. 40, issue 6, 1086-1094

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 (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (77)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.6.1086 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:40:y:1992:i:6:p:1086-1094

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().