IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i20p13130-d941165.html
   My bibliography  Save this article

Optimization of Snowplow Routes for Real-World Conditions

Author

Listed:
  • Abdullah Rasul

    (Department of Automotive and Mechatronics Engineering, Ontario Tech University, 2000 Simcoe Street North, Oshawa, ON L1G 0C5, Canada)

  • Jaho Seo

    (Department of Automotive and Mechatronics Engineering, Ontario Tech University, 2000 Simcoe Street North, Oshawa, ON L1G 0C5, Canada)

  • Shuoyan Xu

    (Department of Civil and Environmental Engineering, University of Alberta, 116 St. & 85 Ave., Edmonton, AB T6G 2R3, Canada)

  • Tae J. Kwon

    (Department of Civil and Environmental Engineering, University of Alberta, 116 St. & 85 Ave., Edmonton, AB T6G 2R3, Canada)

  • Justin MacLean

    (Office of the Chief Administrative Officer, Municipality of Clarington, 40 Temperance Street, Bowmanville, ON L1C 3A6, Canada)

  • Cody Brown

    (Office of the Chief Administrative Officer, Municipality of Clarington, 40 Temperance Street, Bowmanville, ON L1C 3A6, Canada)

Abstract

During the winter season, snowplowing has a significant effect on road users as it is critical to winter road maintenance and operations. The main goal of this study is to generate optimal routes for snowplowing trucks for efficient road maintenance. In addition to the conventional problem of reducing travel time and distance, this study also incorporates actual operational constraints, such as minimum maintenance standards and driver safety, to improve the overall efficiency of operations. To achieve the objectives, we first implemented the Chinese Postman Problem (CPP) to create Euler circuits from the initial routes and then identified the shortest paths by applying Dijkstra’s algorithm. Then, the Tabu search algorithm was chosen as a metaheuristic algorithm for the optimization process that finds near-optimal solutions by considering operational constraints for snowplow routes. Unsafe turning conditions and minimum maintenance standards were taken into account in the objective function defined for the optimization process. In simulations, the route obtained by our approach was compared to one with the application of CPP only in terms of travel distance, time, turning conditions, and road maintenance priority.

Suggested Citation

  • Abdullah Rasul & Jaho Seo & Shuoyan Xu & Tae J. Kwon & Justin MacLean & Cody Brown, 2022. "Optimization of Snowplow Routes for Real-World Conditions," Sustainability, MDPI, vol. 14(20), pages 1-17, October.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:20:p:13130-:d:941165
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/20/13130/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/20/13130/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sullivan, James L. & Dowds, Jonathan & Novak, David C. & Scott, Darren M. & Ragsdale, Cliff, 2019. "Development and application of an iterative heuristic for roadway snow and ice control," Transportation Research Part A: Policy and Practice, Elsevier, vol. 127(C), pages 18-31.
    2. Korteweg, Peter & Volgenant, Ton, 2006. "On the Hierarchical Chinese Postman Problem with linear ordered classes," European Journal of Operational Research, Elsevier, vol. 169(1), pages 41-52, February.
    3. Nathalie Perrier & André Langevin & Ciro-Alberto Amaya, 2008. "Vehicle Routing for Urban Snow Plowing Operations," Transportation Science, INFORMS, vol. 42(1), pages 44-56, February.
    4. Malandraki, Chryssi & Daskin, Mark S., 1993. "The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 65(2), pages 218-234, March.
    5. Fred Glover, 1990. "Tabu Search: A Tutorial," Interfaces, INFORMS, vol. 20(4), pages 74-94, August.
    6. Edward Minieka, 1979. "The Chinese Postman Problem for Mixed Networks," Management Science, INFORMS, vol. 25(7), pages 643-648, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiaoguang Bao & Xinhao Ni, 2024. "Approximation algorithms for two clustered arc routing problems," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-12, July.
    2. Marco Colombi & Ángel Corberán & Renata Mansini & Isaac Plana & José M. Sanchis, 2017. "The Hierarchical Mixed Rural Postman Problem," Transportation Science, INFORMS, vol. 51(2), pages 755-770, May.
    3. Nguyen, Phuong H.D. & Tran, Daniel, 2024. "Constraint-Based snowplow optimization model for winter maintenance operations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 179(C).
    4. Sullivan, James L. & Dowds, Jonathan & Novak, David C. & Scott, Darren M. & Ragsdale, Cliff, 2019. "Development and application of an iterative heuristic for roadway snow and ice control," Transportation Research Part A: Policy and Practice, Elsevier, vol. 127(C), pages 18-31.
    5. Colombi, Marco & Corberán, Ángel & Mansini, Renata & Plana, Isaac & Sanchis, José M., 2017. "The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 257(1), pages 1-12.
    6. H. A. J. Crauwels & C. N. Potts & L. N. Van Wassenhove, 1998. "Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 341-350, August.
    7. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    8. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    9. Xi Chen & Enlu Zhou, 2015. "Population model-based optimization," Journal of Global Optimization, Springer, vol. 63(1), pages 125-148, September.
    10. David R. Morrison & Jason J. Sauppe & Wenda Zhang & Sheldon H. Jacobson & Edward C. Sewell, 2017. "Cyclic best first search: Using contours to guide branch‐and‐bound algorithms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 64-82, February.
    11. Vaithyanathan, Shivakumar & Burke, Laura I. & Magent, Michael A., 1996. "Massively parallel analog tabu search using neural networks applied to simple plant location problems," European Journal of Operational Research, Elsevier, vol. 93(2), pages 317-330, September.
    12. Kolahan, F. & Liang, M., 1998. "An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 109(1), pages 142-159, August.
    13. Ko, Young Dae, 2019. "The airfare pricing and seat allocation problem in full-service carriers and subsidiary low-cost carriers," Journal of Air Transport Management, Elsevier, vol. 75(C), pages 92-102.
    14. Sayarshad, Hamid R. & Du, Xinpi & Gao, H. Oliver, 2020. "Dynamic post-disaster debris clearance problem with re-positioning of clearance equipment items under partially observable information," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 352-372.
    15. Piñeyro, Pedro & Viera, Omar, 2010. "The economic lot-sizing problem with remanufacturing and one-way substitution," International Journal of Production Economics, Elsevier, vol. 124(2), pages 482-488, April.
    16. Tarasewich, Peter & McMullen, Patrick R., 2001. "A pruning heuristic for use with multisource product design," European Journal of Operational Research, Elsevier, vol. 128(1), pages 58-73, January.
    17. Tsai, Ying-Wei & D. Gemmill, Douglas, 1998. "Using tabu search to schedule activities of stochastic resource-constrained projects," European Journal of Operational Research, Elsevier, vol. 111(1), pages 129-141, November.
    18. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.
    19. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1605-1615, December.
    20. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:14:y:2022:i:20:p:13130-:d:941165. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.