IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v327y2025i1p309-325.html

Deep reinforcement learning for solving the stochastic e-waste collection problem

Author

Listed:
  • Nguyen, Dang Viet Anh
  • Gunawan, Aldy
  • Misir, Mustafa
  • Hui, Lim Kwan
  • Vansteenwegen, Pieter

Abstract

With the growing influence of the internet and information technology, Electrical and Electronic Equipment (EEE) has become a gateway to technological innovations. However, discarded devices, also called e-waste, pose a significant threat to the environment and human health if not properly treated, disposed of, or recycled. In this study, we extend a novel model for the e-waste collection in an urban context: the Heterogeneous VRP with Multiple Time Windows and Stochastic Travel Times (HVRP-MTWSTT). We propose a solution method that employs deep reinforcement learning to guide local search heuristics (DRL-LSH). The contributions of this paper are as follows: (1) HVRP-MTWSTT represents the first stochastic VRP in the context of the e-waste collection problem, incorporating complex constraints such as multiple time windows across a multi-period horizon with a heterogeneous vehicle fleet, (2) The DRL-LSH model uses deep reinforcement learning to provide an online adaptive operator selection layer, selecting the appropriate heuristic based on the search state. The computational experiments demonstrate that DRL-LSH outperforms the state-of-the-art hyperheuristic method by 24.26% on large-scale benchmark instances, with the performance gap increasing as the problem size grows. Additionally, to demonstrate the capability of DRL-LSH in addressing real-world problems, we tested and compared it with reference metaheuristic and hyperheuristic algorithms using a real-world e-waste collection case study in Singapore. The results showed that DRL-LSH significantly outperformed the reference algorithms on a real-world instance in terms of operating profit.

Suggested Citation

  • Nguyen, Dang Viet Anh & Gunawan, Aldy & Misir, Mustafa & Hui, Lim Kwan & Vansteenwegen, Pieter, 2025. "Deep reinforcement learning for solving the stochastic e-waste collection problem," European Journal of Operational Research, Elsevier, vol. 327(1), pages 309-325.
  • Handle: RePEc:eee:ejores:v:327:y:2025:i:1:p:309-325
    DOI: 10.1016/j.ejor.2025.04.033
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725003182
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.04.033?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. 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.
    2. Kallestad, Jakob & Hasibi, Ramin & Hemmati, Ahmad & Sörensen, Kenneth, 2023. "A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 309(1), pages 446-468.
    3. Ulrike Ritzinger & Jakob Puchinger & Richard F. Hartl, 2016. "A survey on dynamic and stochastic vehicle routing problems," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 215-231, January.
    4. Pourhejazy, Pourya & Zhang, Dali & Zhu, Qinghua & Wei, Fangfang & Song, Shuang, 2021. "Integrated E-waste transportation using capacitated general routing problem with time-window," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    5. Léo Baty & Kai Jungel & Patrick S. Klein & Axel Parmentier & Maximilian Schiffer, 2024. "Combinatorial Optimization-Enriched Machine Learning to Solve the Dynamic Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 58(4), pages 708-725, July.
    6. Khalid Aljohani & Russell G. Thompson, 2020. "An Examination of Last Mile Delivery Practices of Freight Carriers Servicing Business Receivers in Inner-City Areas," Sustainability, MDPI, vol. 12(7), pages 1-21, April.
    7. Soeffker, Ninja & Ulmer, Marlin W. & Mattfeld, Dirk C., 2022. "Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review," European Journal of Operational Research, Elsevier, vol. 298(3), pages 801-820.
    8. Bengio, Yoshua & Lodi, Andrea & Prouvost, Antoine, 2021. "Machine learning for combinatorial optimization: A methodological tour d’horizon," European Journal of Operational Research, Elsevier, vol. 290(2), pages 405-421.
    9. Zhang, Yuchang & Bai, Ruibin & Qu, Rong & Tu, Chaofan & Jin, Jiahuan, 2022. "A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties," European Journal of Operational Research, Elsevier, vol. 300(2), pages 418-427.
    10. Christina Hess & Alina G. Dragomir & Karl F. Doerner & Daniele Vigo, 2024. "Waste collection routing: a survey on problems and methods," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(2), pages 399-434, June.
    11. Drake, John H. & Kheiri, Ahmed & Özcan, Ender & Burke, Edmund K., 2020. "Recent advances in selection hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 405-428.
    12. Zhang, Jian & Luo, Kelin & Florio, Alexandre M. & Van Woensel, Tom, 2023. "Solving large-scale dynamic vehicle routing problems with stochastic requests," European Journal of Operational Research, Elsevier, vol. 306(2), pages 596-614.
    13. Liberto, Giovanni Di & Kadioglu, Serdar & Leo, Kevin & Malitsky, Yuri, 2016. "DASH: Dynamic Approach for Switching Heuristics," European Journal of Operational Research, Elsevier, vol. 248(3), pages 943-953.
    14. Karimi-Mamaghan, Maryam & Mohammadi, Mehrdad & Meyer, Patrick & Karimi-Mamaghan, Amir Mohammad & Talbi, El-Ghazali, 2022. "Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art," European Journal of Operational Research, Elsevier, vol. 296(2), pages 393-422.
    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. Bootaki, Behrang & Zhang, Guoqing, 2024. "A location-production-routing problem for distributed manufacturing platforms: A neural genetic algorithm solution methodology," International Journal of Production Economics, Elsevier, vol. 275(C).
    2. 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).
    3. Lu, Jiawei & Ye, Tinghan & Chen, Wenbo & Van Hentenryck, Pascal, 2025. "Boosting column generation with graph neural networks for joint rider trip planning and crew shift scheduling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 202(C).
    4. Rolim, Gustavo Alencar & Tomazella, Caio Paziani & Nagano, Marcelo Seido, 2025. "On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups," European Journal of Operational Research, Elsevier, vol. 326(2), pages 220-233.
    5. Filom, Siyavash & Amiri, Amir M. & Razavi, Saiedeh, 2022. "Applications of machine learning methods in port operations – A systematic literature review," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    6. Fang, Chao & Han, Zonglei & Wang, Wei & Zio, Enrico, 2023. "Routing UAVs in landslides Monitoring: A neural network heuristic for team orienteering with mandatory visits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    7. Ninja Soeffker & Marlin W. Ulmer & Dirk C. Mattfeld, 2024. "Balancing resources for dynamic vehicle routing with stochastic customer requests," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(2), pages 331-373, June.
    8. Keskin, Merve & Branke, Juergen & Deineko, Vladimir & Strauss, Arne K., 2023. "Dynamic multi-period vehicle routing with touting," European Journal of Operational Research, Elsevier, vol. 310(1), pages 168-184.
    9. Lagos, Felipe & Pereira, Jordi, 2024. "Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 70-91.
    10. Zhou, Fangting & Lischka, Attila & Kulcsár, Balázs & Wu, Jiaming & Haghir Chehreghani, Morteza & Laporte, Gilbert, 2025. "Learning for routing: A guided review of recent developments and future directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 202(C).
    11. Marcel Panzer & Norbert Gronau, 2024. "Designing an adaptive and deep learning based control framework for modular production systems," Journal of Intelligent Manufacturing, Springer, vol. 35(8), pages 4113-4136, December.
    12. Martí, Rafael & Sevaux, Marc & Sörensen, Kenneth, 2025. "Fifty years of metaheuristics," European Journal of Operational Research, Elsevier, vol. 321(2), pages 345-362.
    13. Yuanyuan Li & Claudia Archetti & Ivana Ljubić, 2024. "Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates," Transportation Science, INFORMS, vol. 58(5), pages 1143-1165, September.
    14. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    15. Nikolaus Furian & Michael O’Sullivan & Cameron Walker & Eranda Çela, 2021. "A machine learning-based branch and price algorithm for a sampled vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(3), pages 693-732, September.
    16. Wang, Hongfei & Guan, Hongzhi & Qin, Huanmei & Zhao, Pengfei, 2024. "Assessing the sustainability of time-dependent electric demand responsive transit service through deep reinforcement learning," Energy, Elsevier, vol. 296(C).
    17. Clautiaux, François & Ljubić, Ivana, 2025. "Last fifty years of integer linear programming: A focus on recent practical advances," European Journal of Operational Research, Elsevier, vol. 324(3), pages 707-731.
    18. Hajar Boualamia & Abdelmoutalib Metrane & Imad Hafidi & Oumaima Mellouli, 2025. "A New Adaptation Mechanism of the ALNS Algorithm Using Reinforcement Learning," SN Operations Research Forum, Springer, vol. 6(3), pages 1-26, September.
    19. Paul, Aditya & Levin, Michael W. & Waller, S. Travis & Rey, David, 2025. "Data-driven optimization for drone delivery service planning with online demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 198(C).
    20. Du, Xueqin & Yang, Linying & Wang, Xiuwen & Zha, Min & Zhen, Lu, 2025. "Pricing and capacity optimization for underground logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 203(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:ejores:v:327:y:2025:i:1:p:309-325. 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/locate/eor .

    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.