IDEAS home Printed from https://ideas.repec.org/a/eee/rensus/v184y2023ics1364032123003830.html
   My bibliography  Save this article

A dynamic approach for the multi-compartment vehicle routing problem in waste management

Author

Listed:
  • Mohammadi, Mostafa
  • Rahmanifar, Golman
  • Hajiaghaei-Keshteli, Mostafa
  • Fusco, Gaetano
  • Colombaroni, Chiara
  • Sherafat, Ali

Abstract

Urban areas worldwide face a significant environmental challenge which is increasing municipal solid waste rate. Addressing its negative consequences necessitates advancements in waste management systems. Although the previous research focused on the static routing approach in the collection phase, this paper adds a dynamic municipal solid waste collection scheme to optimize vehicle routing, accounting for fluctuations in waste generation and changes in transportation systems. This study employs, for the first time, the application of a discrete choice model (DCM) to streamline the process of re-optimization in dynamic vehicle routing problems (DVRP). At each decision epoch, DCM is applied to determine the likelihood of choosing the next geographical zone to visit bins based on current waste generation levels and traveling costs. Moreover, the multi-compartment vehicles are considered to preserve waste segregation during transportation, thereby increasing operational efficiency and regulatory compliance. Another contribution of this paper is to determine visiting priority for each bin by adjusting the time window based on the threshold waste level. Hence, this paper proposes a framework for sustainable, efficient, and effective waste management practices by integrating the benefits of dynamic and multi-compartment routing. Furthermore, a hybrid Genetic and Particle Swarm Optimization algorithm has been designed to find the best solution for the studied problem as well as some of the latest and most proficient metaheuristic algorithms. Finally, the Best Worst Method is applied to find the best-proposed algorithm to solve the presented problem, indicating that the hybrid algorithm has the highest performance in providing high-quality route plans.

Suggested Citation

  • Mohammadi, Mostafa & Rahmanifar, Golman & Hajiaghaei-Keshteli, Mostafa & Fusco, Gaetano & Colombaroni, Chiara & Sherafat, Ali, 2023. "A dynamic approach for the multi-compartment vehicle routing problem in waste management," Renewable and Sustainable Energy Reviews, Elsevier, vol. 184(C).
    • Handle: RePEc:eee:rensus:v:184:y:2023:i:c:s1364032123003830
    DOI: 10.1016/j.rser.2023.113526
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1364032123003830
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.rser.2023.113526?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Maryam Abdirad & Krishna Krishnan & Deepak Gupta, 2021. "A two-stage metaheuristic algorithm for the dynamic vehicle routing problem in Industry 4.0 approach," Journal of Management Analytics, Taylor & Francis Journals, vol. 8(1), pages 69-83, January.
    2. Ennio Cascetta, 2009. "Random Utility Theory," Springer Optimization and Its Applications, in: Transportation Systems Analysis, chapter 0, pages 89-167, Springer.
    3. Xianshun Chen & Liang Feng & Yew Soon Ong, 2012. "A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem," International Journal of Systems Science, Taylor & Francis Journals, vol. 43(7), pages 1347-1366.
    4. Said Dabia & Stefan Ropke & Tom van Woensel & Ton De Kok, 2013. "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 47(3), pages 380-396, August.
    5. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    6. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    7. Ferrucci, Francesco & Bock, Stefan & Gendreau, Michel, 2013. "A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods," European Journal of Operational Research, Elsevier, vol. 225(1), pages 130-141.
    8. Ferrucci, Francesco & Bock, Stefan, 2016. "Pro-active real-time routing in applications with multiple request patterns," European Journal of Operational Research, Elsevier, vol. 253(2), pages 356-371.
    9. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    10. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
    11. Li, Xiangyong & Tian, Peng & Leung, Stephen C.H., 2010. "Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm," International Journal of Production Economics, Elsevier, vol. 125(1), pages 137-145, May.
    12. Rezaei, Jafar, 2015. "Best-worst multi-criteria decision-making method," Omega, Elsevier, vol. 53(C), pages 49-57.
    13. Pandelis, D.G. & Karamatsoukis, C.C. & Kyriakidis, E.G., 2013. "Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery," European Journal of Operational Research, Elsevier, vol. 231(3), pages 577-586.
    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. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    2. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    3. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    4. Rincon-Garcia, Nicolas & Waterson, Ben & Cherrett, Tom J. & Salazar-Arrieta, Fernando, 2020. "A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 429-446.
    5. Nikola Mardešić & Tomislav Erdelić & Tonči Carić & Marko Đurasević, 2023. "Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment," Mathematics, MDPI, vol. 12(1), pages 1-44, December.
    6. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    7. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    8. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    9. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    10. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    11. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    12. Stefan Vonolfen & Michael Affenzeller, 2016. "Distribution of waiting time for dynamic pickup and delivery problems," Annals of Operations Research, Springer, vol. 236(2), pages 359-382, January.
    13. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
    14. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    15. Justin C. Goodson & Barrett W. Thomas & Jeffrey W. Ohlmann, 2016. "Restocking-Based Rollout Policies for the Vehicle Routing Problem with Stochastic Demand and Duration Limits," Transportation Science, INFORMS, vol. 50(2), pages 591-607, May.
    16. Michael Drexl, 2018. "On the One-to-One Pickup-and-Delivery Problem with Time Windows and Trailers," Working Papers 1816, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    17. Cui, Haipeng & Li, Keyu & Jia, Shuai & Meng, Qiang, 2024. "Dynamic collaborative truck-drone delivery with en-route synchronization and random requests," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    18. Briseida Sarasola & Karl Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    19. Reusken, Meike & Laporte, Gilbert & Rohmer, Sonja U.K. & Cruijssen, Frans, 2024. "Vehicle routing with stochastic demand, service and waiting times — The case of food bank collection problems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 111-127.
    20. Rahma Lahyani & Mahdi Khemakhem & Frédéric Semet, 2017. "A unified matheuristic for solving multi-constrained traveling salesman problems with profits," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 393-422, September.

    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:eee:rensus:v:184:y:2023:i:c:s1364032123003830. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600126/description#description .

    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.