Heuristics for a dynamic rural postman problem
From MaRDI portal
Publication:883291
DOI10.1016/j.cor.2005.12.008zbMath1123.90062OpenAlexW2016869987MaRDI QIDQ883291
Luís M. Moreira, José Fernando Oliveira, Antonio Miguel Gomes, José Soeiro Ferreira
Publication date: 4 June 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.12.008
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items (10)
GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ Hybrid genetic algorithm for the open capacitated arc routing problem ⋮ Arc routing under uncertainty: introduction and literature review ⋮ Modeling and solving the endpoint cutting problem ⋮ Effects of update frequencies in a dynamic capacitated arc routing problem ⋮ The open capacitated arc routing problem ⋮ Adaptive demand peak management in online transport process planning ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Lower bounds for the mixed capacitated arc routing problem ⋮ Exact approaches for the cutting path determination problem
Uses Software
Cites Work
- Solution approaches to irregular nesting problems
- The rural postman problem with deadline classes
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
- TOPOS -- A new constructive algorithm for nesting problems
- A 2-exchange heuristic for nesting problems
- On crossings, the Crossing Postman Problem, and the Rural Postman Problem
- The laser-plotter beam routing problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
This page was built for publication: Heuristics for a dynamic rural postman problem