Solving arc routing problems with turn penalties
From MaRDI portal
Publication:4658427
DOI10.1057/palgrave.jors.2601052zbMath1131.90310MaRDI QIDQ4658427
Gilbert Laporte, Patrick Soriano, J. Clossey
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
heuristics; travelling salesman problem; Chinese postman problem; arc routing problems; turn penalties
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
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, 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