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

DOI10.1287/OPRE.1040.0205MaRDI QIDQ5322152zbMATH OpenOpenAlexFDO

Authors Patrick Beullens, Luc Muyldermans, Dirk Cattrysse, D. Van Oudheusden

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)

Recommendations

• Node, edge, arc routing and turn penalties: multiple problems -- one neighborhood extension
• An approximation algorithm for the general routing problem
• A cutting plane algorithm for the general routing problem
• A guided local search heuristic for the capacitated arc routing problem
• The generalized arc routing problem

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322152)