Solving arc routing problems with turn penalties
From MaRDI portal
Publication:4658427
DOI10.1057/palgrave.jors.2601052zbMath1131.90310OpenAlexW2067099317MaRDI QIDQ4658427
J. Clossey, Patrick Soriano, Gilbert Laporte
Publication date: 16 March 2005
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.2601052
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ Modeling and Solving the Intersection Inspection Rural Postman Problem ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ A branch‐and‐dive heuristic for single vehicle snow removal ⋮ The capacitated general windy routing problem with turn penalties ⋮ Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks ⋮ A two-stage solution approach for the directed rural postman problem with turn penalties ⋮ Route planning with turn restrictions: A computational experiment ⋮ 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
