Heuristics for the rural postman problem

Authors:
Kaj Holmberg
Affiliations:
Department of Mathematics, Linköping Institute of Technology, SE-581 83 Linköping, Sweden
Venue:
Computers and Operations Research
Year:
2010

Citing 6
Cited 0

Algorithms for the rural postman problem

Computers and Operations Research
Approximation Algorithms for Some Postman Problems

Journal of the ACM (JACM)
Finding rural postman tours

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-And-Bound

Operations Research
A constructive heuristic for the undirected rural postman problem

Computers and Operations Research
Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem

Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

When addressing the problem of snow removal for secondary roads, a tool for solving the rural postman problem can be very useful. We present some ideas for heuristics for this problem. The heuristics are of the same type as the classical Frederickson heuristic. The ideas concern the order of the main steps in such a method, namely constructing a connected graph with all vertices having even degree, containing all the required edges. We also propose two postprocessing heuristics for improving the tours and removing unnecessary detours. The computational tests show that the ideas are interesting alternatives to the classical approach, and that running times are acceptable. We study problem characteristics that may indicate which method to choose.