IDEAS home Printed from https://ideas.repec.org/a/gam/jlogis/v7y2023i4p72-d1256124.html
   My bibliography  Save this article

Adaptive Large Neighborhood Search Metaheuristic for the Capacitated Vehicle Routing Problem with Parcel Lockers

Author

Listed:
  • Amira Saker

    (Department of Industrial and Manufacturing Engineering, Egypt-Japan University of Science and Technology (EJUST), Alexandria 21934, Egypt
    Production & Mechanical Design Engineering Department, Faculty of Engineering, Mansoura University, Mansoura 35516, Egypt)

  • Amr Eltawil

    (Department of Industrial and Manufacturing Engineering, Egypt-Japan University of Science and Technology (EJUST), Alexandria 21934, Egypt
    Production Engineering Department, Faculty of Engineering, Alexandria University, Alexandria 21544, Egypt)

  • Islam Ali

    (Department of Industrial and Manufacturing Engineering, Egypt-Japan University of Science and Technology (EJUST), Alexandria 21934, Egypt
    Production Engineering Department, Faculty of Engineering, Alexandria University, Alexandria 21544, Egypt)

Abstract

Background : The growth of e-commerce necessitates efficient logistics management to address rising last-mile delivery challenges. To overcome some of the last-mile delivery costs, parcel lockers as a delivery option, can be an alternative solution. This study presents the Capacitated Vehicle Routing Problem with Delivery Options (CVRPDO), which includes locker delivery. Methods : this problem is solved with An Adaptive Large Neighborhood Search (ALNS). The solution suggests some specific destroy and repair operators and integrates them with various selection schemes. The proposed method results are compared with the exact solution of the MIP model of the problem for validation. Results : Objective function values improved by 25%, 30%, 7%, 5%, and 6% for 1000, 800, 600, 400, and 200 customers, respectively, when using a 120-s ALNS runtime compared to the MIP model with a 3-h runtime. Conclusions : the CVRPDO problem involves creating a set of routes for ve-hicles that visit each customer at their delivery location or deliver their parcels to one of the lockers. These routes should respect the capacity of each vehicle and locker while minimizing the total routing costs and the number of utilized vehicles. The problem is resolved by ALNS algorithm, which outperformed the MIP model.

Suggested Citation

  • Amira Saker & Amr Eltawil & Islam Ali, 2023. "Adaptive Large Neighborhood Search Metaheuristic for the Capacitated Vehicle Routing Problem with Parcel Lockers," Logistics, MDPI, vol. 7(4), pages 1-27, October.
    • Handle: RePEc:gam:jlogis:v:7:y:2023:i:4:p:72-:d:1256124
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2305-6290/7/4/72/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2305-6290/7/4/72/
    Download Restriction: no
    ---><---

    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. Pawel Sitek & Jarosław Wikarek, 2019. "Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach," Annals of Operations Research, Springer, vol. 273(1), pages 257-277, February.
    3. Ozbaygin, Gizem & Savelsbergh, Martin, 2019. "An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 207-235.
    4. Yael Deutsch & Boaz Golany, 2018. "A parcel locker network as a solution to the logistics last mile problem," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 251-261, January.
    5. Ghiani, Gianpaolo & Improta, Gennaro, 2000. "An efficient transformation of the generalized vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 11-17, April.
    6. Pier Luigi Parcu & Timothy J. Brennan & Victor Glass (ed.), 2020. "The Changing Postal Environment," Topics in Regulatory Economics and Policy, Springer, number 978-3-030-34532-7, June.
    7. Alberto Santini & Stefan Ropke & Lars Magnus Hvattum, 2018. "A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic," Journal of Heuristics, Springer, vol. 24(5), pages 783-815, October.
    8. Lin Zhou & Xu Wang & Lin Ni & Yun Lin, 2016. "Location-Routing Problem with Simultaneous Home Delivery and Customer’s Pickup for City Distribution of Online Shopping Purchases," Sustainability, MDPI, vol. 8(8), pages 1-20, August.
    9. Alcaraz, Juan J. & Caballero-Arnaldos, Luis & Vales-Alonso, Javier, 2019. "Rich vehicle routing problem with last-mile outsourcing decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 263-286.
    10. 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.
    11. Zhou, Lin & Baldacci, Roberto & Vigo, Daniele & Wang, Xu, 2018. "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution," European Journal of Operational Research, Elsevier, vol. 265(2), pages 765-778.
    12. Mahmutoğulları, Özlem & Yaman, Hande, 2023. "A Branch-and-Cut Algorithm for the Inventory Routing Problem with Product Substitution," Omega, Elsevier, vol. 115(C).
    13. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Roberto Montemanni & Derek H. Smith, 2024. "A Compact Model for the Clustered Orienteering Problem," Logistics, MDPI, vol. 8(2), pages 1-15, May.
    2. Francesco Pilati & Riccardo Tronconi, 2024. "Tri-Objective Vehicle Routing Problem to Optimize the Distribution Process of Sustainable Local E-Commerce Platforms," Sustainability, MDPI, vol. 16(5), pages 1-36, February.

    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. Vincent F. Yu & Hadi Susanto & Yu-Hsuan Yeh & Shih-Wei Lin & Yu-Tsung Huang, 2022. "The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers," Mathematics, MDPI, vol. 10(6), pages 1-22, March.
    2. Zhang, Ruijuan & Dai, Ying & Yang, Fei & Ma, Zujun, 2024. "A cooperative vehicle routing problem with delivery options for simultaneous pickup and delivery services in rural areas," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
    3. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    4. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    5. Jasmin Grabenschweiger & Karl F. Doerner & Richard F. Hartl & Martin W. P. Savelsbergh, 2021. "The vehicle routing problem with heterogeneous locker boxes," 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. 29(1), pages 113-142, March.
    6. Nima Pourmohammadreza & Mohammad Reza Akbari Jokar, 2023. "A Novel Two-Phase Approach for Optimization of the Last-Mile Delivery Problem with Service Options," Sustainability, MDPI, vol. 15(10), pages 1-25, May.
    7. Le Colleter, Théo & Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2023. "Small and large neighborhood search for the park-and-loop routing problem with parking selection," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1233-1248.
    8. Li, Hongqi & Wang, Haotian & Chen, Jun & Bai, Ming, 2020. "Two-echelon vehicle routing problem with time windows and mobile satellites," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 179-201.
    9. Yu, Vincent F. & Jodiawan, Panca & Redi, A.A.N. Perwira, 2022. "Crowd-shipping problem with time windows, transshipment nodes, and delivery options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    10. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Vigo, Daniele, 2021. "A column generation based heuristic for the generalized vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    11. 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.
    12. Mancini, Simona & Gansterer, Margaretha & Triki, Chefi, 2023. "Locker box location planning under uncertainty in demand and capacity availability," Omega, Elsevier, vol. 120(C).
    13. Li, Hongqi & Wang, Haotian & Chen, Jun & Bai, Ming, 2021. "Two-echelon vehicle routing problem with satellite bi-synchronization," European Journal of Operational Research, Elsevier, vol. 288(3), pages 775-793.
    14. Wang, Yu & Ropke, Stefan & Wen, Min & Bergh, Simon, 2023. "The mobile production vehicle routing problem: Using 3D printing in last mile distribution," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1407-1423.
    15. John Olsson & Daniel Hellström & Henrik Pålsson, 2019. "Framework of Last Mile Logistics Research: A Systematic Review of the Literature," Sustainability, MDPI, vol. 11(24), pages 1-25, December.
    16. 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.
    17. 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.
    18. Raeesi, Ramin & Zografos, Konstantinos G., 2020. "The electric vehicle routing problem with time windows and synchronised mobile battery swapping," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 101-129.
    19. Tolga Bektaş & Güneş Erdoğan & Stefan Røpke, 2011. "Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 299-316, August.
    20. Gläser, Sina, 2022. "A waste collection problem with service type option," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1216-1230.

    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:jlogis:v:7:y:2023:i:4:p:72-:d:1256124. 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.