Heuristics for the mixed rural postman problem

DOI10.1016/S0305-0548(99)00031-3zbMATH Open0944.90009OpenAlexW2084507558MaRDI QIDQ1968592FDOQ1968592

Authors: Rafael Martí, Antonio Romero, Ángel Corberán 

Publication date: 22 June 2000

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00031-3

Recommendations

• The Rural Postman Problem on mixed graphs with turn penalties
• A GRASP heuristic for the mixed Chinese postman problem
• A heuristic algorithm for the mixed Chinese postman problem
• The rural postman problem on directed, mixed, and windy graphs
• Finding postal carrier walk paths in mixed graphs

zbMATH Keywords

metaheuristicstabu searcharc routingpostman problems

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Search theory (90B40)

Cited In (12)

• Improvement Procedures for the Undirected Rural Postman Problem
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
• A metaheuristic for the min-max windy rural postman problem with K vehicles
• Heuristics for the mixed swapping problem
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
• Heuristics for single-pass welding task sequencing
• A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
• The Rural Postman Problem on mixed graphs with turn penalties
• Recent results on arc routing problems: an annotated bibliography
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
• Heuristics for a dynamic rural postman problem
• Heuristics for the rural postman problem

This page was built for publication: Heuristics for the mixed rural postman problem

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