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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
A Heuristic Method for Routing Snowplows After Snowfall
Linköping University, Department of Mathematics.
Linköping University, Department of Mathematics.
2004 (English)Independent thesis Basic level (professional degree)Student thesis
Abstract [en]

Sweden experiences heavy snowfall during the winter season and cost effective road maintenance is significantly affected by the routing of snowplows. The routing problem becomes more complex as the SwedishNational Road Administration (Vägverket) sets operational requirements such as satisfying a time window for each road segment.

This thesis focuses on route optimization for snowplows after snowfall; to develop and implement an algorithm for finding combinations of generated routes which minimize the total cost. The results are compared to those stated in the licentiate thesis by Doctoral student Nima Golbaharan (2001).

The algorithm calculates a lower bound to the problem using a Lagrangian master problem. A common subgradient approach is used to find near-optimal dual variables to be sent to a column-generation program which returns routes for the snowplows. A greedy heuristic chooses a feasible solution, which gives an upper bound to the problem. This entire process is repeated as needed.

This method for routing snowplows produces favorable results with a relatively small number of routes and are comparable to Golbaharan's results. An interesting observation involves the allocation of vehicles in which certain depots were regularly over- or under-utilized. This suggests that the quantity and/or distribution of available vehicles may not be optimal.

Place, publisher, year, edition, pages
Matematiska institutionen , 2004.
Keyword [en]
Mathematical optimization, systems theory, Optimization, Lagrangian Relaxation, Subgradient, Heuristics, Routing, Snow Removal
Keyword [sv]
Optimeringslära, systemteori
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-2550ISRN: LITH-MAT-EX--04/11--SEOAI: oai:DiVA.org:liu-2550DiVA: diva2:19885
Uppsok
fysik/kemi/matematik
Available from: 2004-10-20 Created: 2004-10-20

Open Access in DiVA

fulltext(594 kB)1204 downloads
File information
File name FULLTEXT01.pdfFile size 594 kBChecksum MD5
7cfcb05f6fbedb783c3d93dfb945929d5debd01056b2c1c7d78a5a415ba976e36681cc20
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 1204 downloads
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

urn-nbn

Altmetric score

urn-nbn
Total: 511 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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