The capacitated general windy routing problem with turn penalties
From MaRDI portal
Publication:433125
DOI10.1016/j.orl.2011.04.007zbMath1242.90057OpenAlexW2057691282MaRDI QIDQ433125
Publication date: 13 July 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/36787
Related Items (2)
A two-stage solution approach for the directed rural postman problem with turn penalties ⋮ Route planning with turn restrictions: A computational experiment
Uses Software
Cites Work
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- An efficient transformation of the generalized vehicle routing problem
- Solving an urban waste collection problem using ants heuristics
- Lower and upper bounds for the mixed capacitated arc routing problem
- A new ILP-based refinement heuristic for vehicle routing problems
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Some applications of the generalized vehicle routing problem
- The Capacitated Canadian Postman Problem
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- Solving arc routing problems with turn penalties
- The Directed Rural Postman Problem with Turn Penalties
- A transformation for the mixed general routing problem with turn penalties
- The Rural Postman Problem on mixed graphs with turn penalties
This page was built for publication: The capacitated general windy routing problem with turn penalties