liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Heuristics for the rural postman problem
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0001-5907-0087
2010 (English)In: Computers & Operations Research, ISSN 0305-0548, Vol. 37, no 5, 981-990 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2010. Vol. 37, no 5, 981-990 p.
Keyword [en]
Snow removal, Rural postman problem, Heuristics
National Category
URN: urn:nbn:se:liu:diva-52910DOI: 10.1016/j.cor.2009.08.004OAI: diva2:285747
Available from: 2010-01-13 Created: 2010-01-12 Last updated: 2013-08-29

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Holmberg, Kaj
By organisation
Optimization The Institute of Technology
In the same journal
Computers & Operations Research

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 425 hits
ReferencesLink to record
Permanent link

Direct link