The Directed Rural Postman Problem with Turn Penalties
DOI10.1287/TRSC.33.4.408zbMATH Open0958.90003OpenAlexW2157186430MaRDI QIDQ4950871FDOQ4950871
Authors: 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
Recommendations
- The Rural Postman Problem on mixed graphs with turn penalties
- A two-stage solution approach for the directed rural postman problem with turn penalties
- An algorithm for the Rural Postman problem on a directed graph
- A computational study of several heuristics for the DRPP
- The rural postman problem on directed, mixed, and windy graphs
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (17)
- Solution of real-world postman problems
- An algorithm for the Rural Postman problem on a directed graph
- 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
- Solving arc routing problems with turn penalties
- Searching for a strong double tracing in a graph
- The capacitated general windy routing problem with turn penalties
- An ILP-refined tabu search for the directed profitable rural postman problem
- Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
- A concise guide to existing and emerging vehicle routing problem variants
- Modeling and Solving the Intersection Inspection Rural Postman Problem
- The Rural Postman Problem on mixed graphs with turn penalties
- A branch‐and‐dive heuristic for single vehicle snow removal
- Recent results on arc routing problems: an annotated bibliography
- Solving the large-scale min-max \(k\)-rural postman problem for snow plowing
- Evolutionary algorithms for periodic arc routing problems
- Lower and upper bounds for the mixed capacitated arc routing problem
This page was built for publication: The Directed Rural Postman Problem with Turn Penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950871)