På den här sidan

In search of good relaxations for the urban snow removal problem

Roghayeh Hajizadeh, 1986- (Författare)Kaj Holmberg, 1955- (Författare)

URI https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-194245, URN urn:nbn:se:liu:diva-194245, DOI 10.3384/LiTH-MAT-R-2023-03, Identifikator https://liu.diva-portal.org/smash/get/diva2:1760409/FULLTEXT01 · url

Linköpings universitet Matematiska institutionen (Utgivare)Linköpings universitet Tekniska fakulteten (Utgivare)

utgivning

Linköping : Linköping University Electronic Press, 2023

1 onlineresurs (46 sidor)

Seriemedlemskap

ISSN 0348-2960, ISSN 0348-2960 · LiTH-MAT-R ; 2023/03

Roghayeh Hajizadeh, Kaj Holmberg

Onlineresurs

Digital resurs · 2 bibliotek

ämne

Natural Sciences, Mathematics, Naturvetenskap, Matematik, Snöröjning, Matematiska metoder

tillhörande media

Sammanfattning och fulltext från Linköping University Electronic Press http://dx.doi.org/10.3384/LiTH-MAT-R-2023-03 https://liu.diva-portal.org/smash/get/diva2:1760409/FULLTEXT01

Fler detaljer Referera

Sammanfattning

Snow removal is, in Sweden, an infrequently occurring challenge. Doing the snow removal more efficiently could give much benefits for society. Since the amounts of snow vary a lot from day to day, and from year to year, fixed plans are not the best. Optimization of the snow removal tours could save much money. In this paper, we study the multi-vehicle urban snow removal problem from a mixed integer programming perspective. It is a very hard problem, and obtaining the exact optimum seems to be out of reach. Therefore, we study relaxations of the problem. Our goal is simply to find the best bounds for the optimal objective function value that is possible in limited time. We present some promising possibilities, verified by extensive computational tests.