The (Over) Zealous Snow Remover Problem
2016 (English)Report (Other academic)
Planning snow removal is a difficult, infrequently occurring optimization problem, concerning complicated routing of vehicles. Clearing a street includes several different activities, and the tours must be allowed to contain subtours. The streets are classified into different types, each type requiring different activities. We address the problem facing a single vehicle, including details such as precedence requirements and turning penalties. We describe a solution approach based on a reformulation to an asymmetric traveling salesman problem in an extended graph, plus a heuristic for finding feasible solutions. The method have been implemented and tested on real life examples, and the solution times are short enough to allow online usage. We compare two different principles for the number of sweeps on a normal street, encountered in discussions with snow removal contractors. A principle using a first sweep in the middle of the street around the block, in order to quickly allow usage of the streets, is found to yield interesting theoretical and practical difficulties.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. , 33 p.
LiTH-MAT-R, ISSN 0348-2960 ; 2016:04
IdentifiersURN: urn:nbn:se:liu:diva-127028ISBN: LiTH-MAT-R--2016/04--SEOAI: oai:DiVA.org:liu-127028DiVA: diva2:919119