Route optimisation for winter maintenance

Nikmal Raghestani, Carsten Keßler*

*Corresponding author for this work

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

Abstract

In many countries, winter maintenance is a requirement to keep public life going throughout the cold season. This paper investigates the optimization of salt spreading routes in Denmark in terms of service time and cost. It looks at salting as a capacitated arc routing problem and proposes a greedy randomized adaptive search procedure to this end. At the core of the proposed approach is a heuristic algorithm based on simulated annealing that improves the initial route by searching for alternatives within a predefined search space, taking into account a number of constraints and criteria at each iteration of the procedure. The performance of the optimization approach is tested on three different existing service routes, where it is shown to reduce route length by an average of 8.7% and service time by an average of 9.5%.

Original languageEnglish
Title of host publicationGeospatial Technologies for Local and Regional Development : Proceedings of the 22nd AGILE Conference on Geographic Information Science
EditorsPhaedon Kyriakidis, Dimitrios Skarlatos, Diofantos Hadjimitsis, Ali Mansourian
Number of pages18
PublisherSpringer
Publication date2019
Pages125-142
ISBN (Print)9783030147440
ISBN (Electronic)9783030147457
DOIs
Publication statusPublished - 2019
Event22nd AGILE Conference on Geographic Information Science, 2019 - Limassol, Cyprus
Duration: 17 Jun 201920 Jun 2019

Conference

Conference22nd AGILE Conference on Geographic Information Science, 2019
Country/TerritoryCyprus
CityLimassol
Period17/06/201920/06/2019
SeriesLecture notes in geoinformation and Cartography
ISSN1863-2246

Keywords

  • Capacitated arc routing problem
  • Route optimization
  • Simulated annealing

Fingerprint

Dive into the research topics of 'Route optimisation for winter maintenance'. Together they form a unique fingerprint.

Cite this