Heuristics for a dynamic rural postman problem

DOI10.1016/j.cor.2005.12.008zbMath1123.90062MaRDI QIDQ883291

José Fernando Oliveira, Luís M. Moreira, José Soeiro Ferreira, Antonio Miguel Gomes

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

zbMATH Keywords

heuristics; combinatorial optimization; arc routing problems; dynamic rural postman problem

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

90B20: Traffic problems in operations research

Related Items

GRASP with evolutionary path-relinking for the capacitated arc routing problem, The open capacitated arc routing problem, Adaptive demand peak management in online transport process planning, Lower bounds for the mixed capacitated arc routing problem, Hybrid genetic algorithm for the open capacitated arc routing problem, Recent results on Arc Routing Problems: An annotated bibliography

Uses Software

• TOPOS

Cites Work

• Unnamed Item
• 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
• The laser-plotter beam routing problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem