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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The (Over)zealous Snow Remover Problem
Linköping University, Department of Mathematics, Optimization . Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-5907-0087
2019 (English)In: Transportation Science, ISSN 0041-1655, E-ISSN 1526-5447, Vol. 53, no 3, p. 867-881Article in journal (Refereed) Published
Abstract [en]

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 and a reordering procedure. The method has been implemented and tested on real life examples, and the solution times are short enough to allow online usage. We compare the solutions to lower bounds obtained by solving a mixed integer programming model. We study 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
INFORMS , 2019. Vol. 53, no 3, p. 867-881
Keywords [en]
routing; traveling salesman; snow removal
National Category
Mathematical Analysis
Identifiers
URN: urn:nbn:se:liu:diva-158836DOI: 10.1287/trsc.2018.0851ISI: 000471630900015OAI: oai:DiVA.org:liu-158836DiVA, id: diva2:1337668
Note

Funding Agencies|Swedish Research Council [2015-04313]

Available from: 2019-07-16 Created: 2019-07-16 Last updated: 2019-07-16

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Holmberg, Kaj
By organisation
Optimization Faculty of Science & Engineering
In the same journal
Transportation Science
Mathematical Analysis

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 5 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf