Heuristics for a dynamic rural postman problem

DOI10.1016/J.COR.2005.12.008zbMATH Open1123.90062OpenAlexW2016869987MaRDI QIDQ883291FDOQ883291

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

Recommendations

• Lower bounds and heuristics for the windy rural postman problem
• A constructive heuristic for the undirected rural postman problem
• Heuristics for the mixed rural postman problem
• A computational study of several heuristics for the DRPP
• Heuristics for the rural postman problem

zbMATH Keywords

heuristicscombinatorial optimizationarc routing problemsdynamic rural postman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Cites Work

• TOPOS -- A new constructive algorithm for nesting problems
• Solution approaches to irregular nesting problems
• A 2-exchange heuristic for nesting problems
• Arc Routing Problems, Part II: The Rural Postman Problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• 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
• The rural postman problem with deadline classes
• A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
• On crossings, the crossing postman problem, and the rural postman problem
• The laser-plotter beam routing problem

Cited In (13)

• Modeling and solving the endpoint cutting problem
• Adaptive demand peak management in online transport process planning
• A metaheuristic for the min-max windy rural postman problem with K vehicles
• Hybrid genetic algorithm for the open capacitated arc routing problem
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• The open capacitated arc routing problem
• Arc routing under uncertainty: introduction and literature review
• Lower bounds for the mixed capacitated arc routing problem
• Exact approaches for the cutting path determination problem
• Effects of update frequencies in a dynamic capacitated arc routing problem
• A parameterized lower bounding method for the open capacitated arc routing problem
• Recent results on Arc Routing Problems: An annotated bibliography

Uses Software

• TOPOS

This page was built for publication: Heuristics for a dynamic rural postman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883291)