Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
From MaRDI portal
Publication:5428949
DOI10.1057/palgrave.jors.2602160zbMath1125.90418OpenAlexW1992330822MaRDI QIDQ5428949
S. Deneault, Gilbert Laporte, Gilbert Babin
Publication date: 29 November 2007
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602160
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Vehicle routing for milk collection with gradual blending: a case arising in Chile ⋮ DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic ⋮ A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem ⋮ A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
This page was built for publication: Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
