The Directed Rural Postman Problem with Turn Penalties
From MaRDI portal
Publication:4950871
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
Cited in
(18)- Solving the large-scale min-max \(k\)-rural postman problem for snow plowing
- Searching for a strong double tracing in a graph
- 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
- The Rural Postman Problem on mixed graphs with turn penalties
- Lower and upper bounds for the mixed capacitated arc routing problem
- A two-stage solution approach for the directed rural postman problem with turn penalties
- Evolutionary algorithms for periodic arc routing problems
- A branch‐and‐dive heuristic for single vehicle snow removal
- 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
- Solving arc routing problems with turn penalties
- An algorithm for the Rural Postman problem on a directed graph
- Recent results on arc routing problems: an annotated bibliography
- A concise guide to existing and emerging vehicle routing problem variants
- An ILP-refined tabu search for the directed profitable rural postman problem
- Modeling and Solving the Intersection Inspection Rural Postman Problem
- The directed profitable rural postman problem with incompatibility constraints
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)