Solving arc routing problems with turn penalties

DOI10.1057/PALGRAVE.JORS.2601052MaRDI QIDQ4658427zbMATH OpenOpenAlexFDO

Authors J. Clossey, G. Laporte, Patrick Soriano

Publication date 16 March 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601052

zbMATH Keywords

arc routing problemsChinese postman problemheuristicstravelling salesman problemturn penalties

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The capacitated general windy routing problem with turn penalties
• Node, edge, arc routing and turn penalties: multiple problems -- one neighborhood extension
• A two-stage solution approach for the directed rural postman problem with turn penalties
• A transformation for the mixed general routing problem with turn penalties
• The Directed Rural Postman Problem with Turn Penalties

Cited in

(16)

• Bounds on penalties for dummy arcs in transportation networks
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
• Route planning with turn restrictions: A computational experiment
• A two-stage solution approach for the directed rural postman problem with turn penalties
• A concise guide to existing and emerging vehicle routing problem variants
• Solution of real-world postman problems
• Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
• Recent results on arc routing problems: an annotated bibliography
• The capacitated general windy routing problem with turn penalties
• Modeling and Solving the Intersection Inspection Rural Postman Problem
• Node, edge, arc routing and turn penalties: multiple problems -- one neighborhood extension
• A transformation for the mixed general routing problem with turn penalties
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
• A branch‐and‐dive heuristic for single vehicle snow removal
• A bi-criterion Steiner traveling salesperson problem with time windows for last-mile electric vehicle logistics
• Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks

This page was built for publication: Solving arc routing problems with turn penalties

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