Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem

DOI10.1287/opre.1040.0205zbMath1165.90349OpenAlexW1993992568MaRDI QIDQ5322152

Patrick Beullens, Dirk D. L. van Oudheusden, Dirk G. Cattrysse, Luc Muyldermans

Publication date: 18 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1040.0205

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Related Items (12)

A guided local search heuristic for the capacitated arc routing problem ⋮ The orienteering problem: a survey ⋮ Improving a constructive heuristic for the general routing problem ⋮ Instance-specific multi-objective parameter tuning based on fuzzy logic ⋮ Real-time scheduling optimization considering the unexpected events in home health care ⋮ On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm ⋮ A guided local search procedure for the multi-compartment capacitated arc routing problem ⋮ A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ A simheuristic algorithm for time-dependent waste collection management with stochastic travel times ⋮ Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration ⋮ Heuristics for the rural postman problem

This page was built for publication: Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem