The Directed Rural Postman Problem with Turn Penalties

DOI10.1287/trsc.33.4.408zbMath0958.90003OpenAlexW2157186430MaRDI QIDQ4950871

Enrique Benavent, David Soler

Publication date: 27 April 2000

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.33.4.408

zbMATH Keywords

networkheuristicscomplexity resultsdirected rural postman problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (13)

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 ⋮ An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation ⋮ Solution of real-world postman problems ⋮ Evolutionary algorithms for periodic arc routing problems ⋮ Lower and upper bounds for the mixed capacitated arc routing problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ The Rural Postman Problem on mixed graphs with turn penalties ⋮ Searching for a strong double tracing in a graph

This page was built for publication: The Directed Rural Postman Problem with Turn Penalties