Improvements to the Or-opt heuristic for the symmetric travelling salesman problem

G Babin (), S Deneault and G Laporte ()
Additional contact information
G Babin: HEC Montréal
S Deneault: HEC Montréal
G Laporte: HEC Montréal

Journal of the Operational Research Society, 2007, vol. 58, issue 3, 402-407

Abstract: Abstract Several variants and generalizations of the Or-opt heuristic for the Symmetric Travelling Salesman Problem are developed and compared on random and planar instances. Some of the proposed algorithms are shown to significantly improve upon the standard 2-opt and Or-opt heuristics.

Keywords: symmetric travelling salesman problem; local search heuristics; edge and chain exchanges (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2602160 Abstract (text/html)
Access to full text is restricted to subscribers.

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:pal:jorsoc:v:58:y:2007:i:3:d:10.1057_palgrave.jors.2602160

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2602160

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().