Advertisement

Route Optimisation for Winter Maintenance

  • Nikmal Raghestani
  • Carsten KeßlerEmail author
Conference paper
Part of the Lecture Notes in Geoinformation and Cartography book series (LNGC)

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%.

Keywords

Capacitated arc routing problem Simulated annealing Route optimization 

References

  1. Arakaki RK, Usberti FL (2018) Hybrid genetic algorithm for the open capacitated arc routing problem. Comput Oper Res 90:221–231.  https://doi.org/10.1016/j.cor.2017.09.020, http://www.sciencedirect.com/science/article/pii/S0305054817302502CrossRefGoogle Scholar
  2. Bodin LD, Golden BL, Assad AA, Ball MO (1981) The state of the art in the routing and scheduling of vehicles and crews. US Department of Transportation, Urban Mass Transportation Administration. https://babel.hathitrust.org/cgi/pt?id=ien.35556021333117;view=1up;seq=13
  3. Chapleau L, Ferland JA, Lapalme G, Rousseau JM (1984) A parallel insert method for the capacitated arc routing problem. Oper Res Lett 3(2):95–99. Accessed 04 Dec 2017CrossRefGoogle Scholar
  4. Christofides N (1973) The optimum traversal of a graph. Omega 1(6):719–732. Accessed 03 Dec 2017CrossRefGoogle Scholar
  5. Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms, 1st edn. MIT Press and McGraw-HillGoogle Scholar
  6. Eglese R (1994) Routeing winter gritting vehicles. Discret Appl Math 48(3):231–244. Accessed: 08 Dec 2017CrossRefGoogle Scholar
  7. Eiselt HA, Gendreau M, Laporte G (1995) Arc routing problems, part ii: the rural postman problem. Oper Res 43(3):399–414. Accessed 15 Dec 2017CrossRefGoogle Scholar
  8. Evans J, Weant M (1990) Strategic planning for snow and ice control vehicles using computer-based routing software. Public Works 121(4):60–64. Accessed 09 Dec 2017Google Scholar
  9. Gendreau M, Hertz A, Laporte G (1992) New insertion and postoptimization procedures for the traveling salesman problem. Oper Res 40(6):1086–1094. Accessed 13 Nov 2017CrossRefGoogle Scholar
  10. Golden BL, Wong RT (1981) Capacitated arc routing problems. Networks 11(3):305–315. Accessed 15 Dec 2017CrossRefGoogle Scholar
  11. Goode L, Nantung T (1995) CASPER: the friendly, efficient snow routes planner. http://onlinepubs.trb.org/onlinepubs/trnews/rpo/rpo.trn181.pdf
  12. Haghani A, Qiao H (2001) Decision support system for snow emergency vehicle routing: algorithms and application. Transp Res Rec: J Transp Res Board 1771:172–178. Accessed 02 Feb 2017CrossRefGoogle Scholar
  13. Haslam E, Wright JR (1991) Application of routing technologies to rural snow and ice control. Transp Res Board 1304:202–211. Accessed 10 Sept 2017Google Scholar
  14. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680. Accessed 29 Nov 2017CrossRefGoogle Scholar
  15. Knudsen F, Eram MM, Jansen KB (2014) Denmark, Technical Committee 2.4, pp 52–60Google Scholar
  16. Kurniawan R, Sulistiyo MD, Wulandari GS (2015) Genetic algorithm for capacitated vehicle routing problem with considering traffic density. In: 2015 international conference on information technology systems and innovation (ICITSI), pp 1–6Google Scholar
  17. Lemieux PF, Gampagna L (1984) The snow ploughing poblem solved by a graph theory algorithm. Civ Eng Syst 1(6):337–341. Accessed 29 Nov 2017CrossRefGoogle Scholar
  18. Male JW, Liebman JC, Orloff CS (1977) An improvement of Orloff’s general routing problem. Networks 7(1):89–92. Accessed 11 Dec 2017CrossRefGoogle Scholar
  19. Metropolis N, Rodenbluth AW, Rosenbluth MN, Teller AH (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087–1092. Accessed 02 Feb 2018Google Scholar
  20. Nemhauser GL, Wolsey LA (1988) Integer programming and combinatorial optimization. Wiley, Chichester; Nemhauser GL, Savelsbergh MWP, Sigismondi GS (1992) Constraint classification for mixed integer programming formulations. COAL Bull 20:8–12Google Scholar
  21. Pearn WL (1989) Approximate solutions for the capacitated arc routing problem. Comput Oper Res 16(6):589–600. Accessed 03 Dec 2017CrossRefGoogle Scholar
  22. Rere LR, Fanany MI, Arymurthy AM (2015) Simulated annealing algorithm for deep learning. Procedia Comput Sci 72(1):137–144. Accessed 23 Nov 2017CrossRefGoogle Scholar
  23. Resende MGC, Ribeiro CC (1997) A grasp for graph planarization. Networks 29(3):173–189. Accessed 16 Oct 2017CrossRefGoogle Scholar
  24. Ruas A, Gold C (2008) Headway in spatial data handling: 13th international symposium on spatial data handling. SpringerGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of PlanningAalborg University CopenhagenCopenhagenDenmark

Personalised recommendations