IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v200y2025ics1366554525002121.html

Reconcile autonomous garbage truck and workload for multiple-period waste pickup schedule considering service frequency for industry 5.0

Author

Listed:
  • Zhang, Dandan
  • Shi, Lei
  • Shi, Yucheng
  • Gao, Yufei
  • Wang, Qingxian

Abstract

The autonomous garbage truck armed with garbage collector robots for unloading/loading waste will be essential for municipal waste collection in Industry 5.0. Due to the juvenility of garbage collector robots, it is significant to reconcile autonomous garbage trucks and sanitation workers in municipal waste management in transition to Industry 5.0. This paper focuses on reconciling the multiple-period waste collection route design of autonomous garbage trucks and the workload of sanitation workers considering the service frequency constraint and introduces a Period Statistics-based Waste Collection Routing Problem (PS-WCRP). We formulate the problem as multi-objective programming and propose an adaptive large neighborhood search-based hierarchical framework to solve it. The experimental results indicate its excellent performance by comparison with commercial tools, Gurobi and other heuristics. Furthermore, the ablation experiment analysis reveals the rationality and effectiveness of our solution framework. Finally, reconciliation is achieved, as proven by the analysis of sanitation workers’ workload.

Suggested Citation

  • Zhang, Dandan & Shi, Lei & Shi, Yucheng & Gao, Yufei & Wang, Qingxian, 2025. "Reconcile autonomous garbage truck and workload for multiple-period waste pickup schedule considering service frequency for industry 5.0," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 200(C).
    • Handle: RePEc:eee:transe:v:200:y:2025:i:c:s1366554525002121
    DOI: 10.1016/j.tre.2025.104171
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525002121
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2025.104171?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Fang, Zhixiang & Zong, Xinlu & Li, Qingquan & Li, Qiuping & Xiong, Shengwu, 2011. "Hierarchical multi-objective evacuation routing in stadium using ant colony optimization approach," Journal of Transport Geography, Elsevier, vol. 19(3), pages 443-451.
    2. Amine Masmoudi, M. & Coelho, Leandro C. & Demir, Emrah, 2022. "Plug-in hybrid electric refuse vehicle routing problem for waste collection," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    3. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    4. Maryam Nikouei Mehr & Ronald G. McGarvey, 2017. "Planning Solid Waste Collection with Robust Optimization: Location-Allocation, Receptacle Type, and Service Frequency," Advances in Operations Research, Hindawi, vol. 2017, pages 1-14, January.
    5. Donald D. Eisenstein & Ananth. V. Iyer, 1997. "Garbage Collection in Chicago: A Dynamic Scheduling Model," Management Science, INFORMS, vol. 43(7), pages 922-933, July.
    6. Wang, Yong & Luo, Siyu & Fan, Jianxin & Zhen, Lu, 2024. "The multidepot vehicle routing problem with intelligent recycling prices and transportation resource sharing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    7. Erfan Babaee Tirkolaee & Alireza Goli & Selma Gütmen & Gerhard-Wilhelm Weber & Katarzyna Szwedzka, 2023. "A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms," Annals of Operations Research, Springer, vol. 324(1), pages 189-214, May.
    8. Maxence Delorme & Sergio García & Jacek Gondzio & Jörg Kalcsics & David Manlove & William Pettersson, 2024. "New Algorithms for Hierarchical Optimization in Kidney Exchange Programs," Operations Research, INFORMS, vol. 72(4), pages 1654-1673, July.
    9. 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).
    10. Amine Masmoudi, M. & Baldacci, Roberto & Mancini, Simona & Kuo, Yong-Hong, 2024. "Multi-compartment waste collection vehicle routing problem with bin washer," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 189(C).
    11. Olmez, Omer Berk & Gultekin, Ceren & Balcik, Burcu & Ekici, Ali & Özener, Okan Örsan, 2022. "A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem," European Journal of Operational Research, Elsevier, vol. 302(1), pages 187-202.
    12. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2016. "An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 95-123.
    13. Vera C. Hemmelmayr & Karl F. Doerner & Richard F. Hartl & Daniele Vigo, 2014. "Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management," Transportation Science, INFORMS, vol. 48(1), pages 103-120, February.
    14. Homburg, Carsten, 1998. "Hierarchical multi-objective decision making," European Journal of Operational Research, Elsevier, vol. 105(1), pages 155-161, February.
    15. Spinelli, Andrea & Maggioni, Francesca & Ramos, Tânia Rodrigues Pereira & Barbosa-Póvoa, Ana Paula & Vigo, Daniele, 2025. "A rolling horizon heuristic approach for a multi-stage stochastic waste collection problem," European Journal of Operational Research, Elsevier, vol. 323(1), pages 276-296.
    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. Spinelli, Andrea & Maggioni, Francesca & Ramos, Tânia Rodrigues Pereira & Barbosa-Póvoa, Ana Paula & Vigo, Daniele, 2025. "A rolling horizon heuristic approach for a multi-stage stochastic waste collection problem," European Journal of Operational Research, Elsevier, vol. 323(1), pages 276-296.
    2. Han, Jialin & Zhang, Jiaxiang & Guo, Haoyue & Zhang, Ning, 2024. "Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm," European Journal of Operational Research, Elsevier, vol. 316(3), pages 958-975.
    3. Yuan, Zijian & Wang, Tao & Tian, Junfang & Zhang, Jing & Zheng, Jianfeng & Wu, Jianjun & Gao, Ziyou, 2026. "Mitigate the range anxiety: two-stage optimization for the electric vehicle routing problem with time windows and battery status uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
    4. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    5. Azcuy, Irecis & Agatz, Niels & Giesen, Ricardo, 2021. "Designing integrated urban delivery systems using public transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    6. Zhang, Zizhen & Qin, Hu & Wang, Kai & He, Huang & Liu, Tian, 2017. "Manpower allocation and vehicle routing problem in non-emergency ambulance transfer service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 45-59.
    7. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    8. 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.
    9. Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    10. He, Dongdong & Ceder, Avishai (Avi) & Zhang, Wenyi & Guan, Wei & Qi, Geqi, 2023. "Optimization of a rural bus service integrated with e-commerce deliveries guided by a new sustainable policy in China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
    11. Jonas Hatzenbühler & Erik Jenelius & Győző Gidófalvi & Oded Cats, 2025. "Multi-purpose pickup and delivery problem for combined passenger and freight transport," Transportation, Springer, vol. 52(5), pages 1975-2006, October.
    12. Worapot Sirirak & Rapeepan Pitakaso, 2018. "Marketplace Location Decision Making and Tourism Route Planning," Administrative Sciences, MDPI, vol. 8(4), pages 1-25, November.
    13. Voigt, Stefan, 2025. "A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 322(2), pages 357-375.
    14. Wy, Juyoung & Kim, Byung-In & Kim, Seongbae, 2013. "The rollon–rolloff waste collection vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 224(3), pages 466-476.
    15. He, Qingying & Liu, Wei & Xi, Haoning, 2025. "Dynamic electric vehicle fleets management problem for multi-service platforms with integrated ride-hailing, on-time delivery, and vehicle-to-grid services," Transportation Research Part B: Methodological, Elsevier, vol. 199(C).
    16. TURKEŠ, Renata & SÖRENSEN, Kenneth & HVATTUM, Lars Magnus & BARRENA, Eva & CHENTLI, Hayet & COELHO, Leandro & DAYARIAN, Iman & GRIMAULT, Axel & GULLHAVE, Anders & IRIS, Çagatay & KESKIN, Merve & KIEFE, 2019. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," Working Papers 2019002, University of Antwerp, Faculty of Business and Economics.
    17. Santos, Maria João & Curcio, Eduardo & Mulati, Mauro Henrique & Amorim, Pedro & Miyazawa, Flávio Keidi, 2020. "A robust optimization approach for the vehicle routing problem with selective backhauls," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    18. Gläser, Sina, 2022. "A waste collection problem with service type option," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1216-1230.
    19. Zhang, Yimeng & Li, Xinlei & van Hassel, Edwin & Negenborn, Rudy R. & Atasoy, Bilge, 2022. "Synchromodal transport planning considering heterogeneous and vague preferences of shippers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    20. Chen, Ran & Yang, Jingjing & Yu, Yugang & Guo, Xiaolong, 2023. "Retrieval request scheduling in a shuttle-based storage and retrieval system with two lifts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:transe:v:200:y:2025:i:c:s1366554525002121. 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/600244/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.