IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i6p920-d770261.html
   My bibliography  Save this article

The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers

Author

Listed:
  • Vincent F. Yu

    (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan
    Center for Cyber-Physical System Innovation, National Taiwan University of Science and Technology, Taipei 106335, Taiwan)

  • Hadi Susanto

    (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan)

  • Yu-Hsuan Yeh

    (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan)

  • Shih-Wei Lin

    (Department of Information Management, Chang Gung University, Taoyuan 33302, Taiwan
    Department of Industrial Engineering and Management, Ming Chi University of Technology, New Taipei 243303, Taiwan
    Department of Emergency Medicine, Keelung Chang Gung Memorial Hospital, Keelung City 20401, Taiwan)

  • Yu-Tsung Huang

    (Kerry TJ Logistics Company Ltd., Taipei 10059, Taiwan)

Abstract

Customers’ expectations of timely and accurate delivery and pickup of online purchases pose a new challenge to last-mile delivery. When the goods sent to customers are not received, they must be returned to the warehouse. This situation provides a high additional cost. Parcel locker systems and convenience stores have been launched to solve this problem and serve as pickup and payment stations. This research investigates a new last-mile distribution problem in the augmented system with three service modes: home delivery and pickup, parcel locker delivery and pickup, and home or parcel locker delivery and pickup. Previously, the simultaneous delivery and pickup problem with time windows (SDPPTW) only considered delivery and pickup to customers. The new problem proposed in this research addresses additional locker pickup and delivery options. The proposed problem is called the vehicle routing problem with simultaneous pickup and delivery and parcel lockers (VRPSPDPL). This research formulated a new mathematical model and developed two simulated annealing (SA) algorithms to solve the problem. The goal is to minimize the total traveling cost. Since there are no existing benchmark instances for the problem, we generate new instances based on SDPPTW benchmark instances. The experimental results show that the proposed algorithms are effective and efficient in solving VRPSPDPL.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:6:p:920-:d:770261
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/6/920/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/6/920/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1991. "Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning," Operations Research, INFORMS, vol. 39(3), pages 378-406, June.
    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. Bortfeldt, Andreas & Yi, Junmin, 2020. "The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 545-558.
    4. Vincent F. Yu & Winarno & Achmad Maulidin & A. A. N. Perwira Redi & Shih-Wei Lin & Chao-Lung Yang, 2021. "Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows," Mathematics, MDPI, vol. 9(14), pages 1-22, July.
    5. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    6. 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.
    7. 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.
    8. Janjevic, Milena & Winkenbach, Matthias, 2020. "Characterizing urban last-mile distribution strategies in mature and emerging e-commerce markets," Transportation Research Part A: Policy and Practice, Elsevier, vol. 133(C), pages 164-196.
    9. 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.
    10. Lachapelle, Ugo & Burke, Matthew & Brotherton, Aiden & Leung, Abraham, 2018. "Parcel locker systems in a car dominant city: Location, characterisation and potential impacts on city planning and consumer travel access," Journal of Transport Geography, Elsevier, vol. 71(C), pages 1-14.
    11. Vakulenko, Yulia & Hellström, Daniel & Hjort, Klas, 2018. "What's in the parcel locker? Exploring customer value in e-commerce last mile delivery," Journal of Business Research, Elsevier, vol. 88(C), pages 421-427.
    12. Agatz, Niels A.H. & Fleischmann, Moritz & van Nunen, Jo A.E.E., 2008. "E-fulfillment and multi-channel distribution - A review," European Journal of Operational Research, Elsevier, vol. 187(2), pages 339-356, June.
    13. Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    14. Xuping Wang & Linmin Zhan & Junhu Ruan & Jun Zhang, 2014. "How to Choose “Last Mile” Delivery Modes for E-Fulfillment," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-11, June.
    15. 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.
    16. Kenan Karagul & Yusuf Sahin & Erdal Aydemir & Aykut Oral, 2019. "A Simulated Annealing Algorithm Based Solution Method for a Green Vehicle Routing Problem with Fuel Consumption," International Series in Operations Research & Management Science, in: Turan Paksoy & Gerhard-Wilhelm Weber & Sandra Huber (ed.), Lean and Green Supply Chain Management, pages 161-187, Springer.
    17. Nur Mayke Eka Normasari & Vincent F. Yu & Candra Bachtiyar & Sukoyo, 2019. "A Simulated Annealing Heuristic for the Capacitated Green Vehicle Routing Problem," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-18, January.
    18. Vincent F. Yu & Putu A. Y. Indrakarna & Anak Agung Ngurah Perwira Redi & Shih-Wei Lin, 2021. "Simulated Annealing with Mutation Strategy for the Share-a-Ride Problem with Flexible Compartments," Mathematics, MDPI, vol. 9(18), pages 1-18, September.
    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. 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.
    2. Wei Xu & Chenghao Zhang & Ming Cheng & Yucheng Huang, 2022. "Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery: Mathematical Modeling and Adaptive Large Neighborhood Search Heuristic Method," Energies, MDPI, vol. 15(23), pages 1-25, December.
    3. Anna Sciomachen & Maria Truvolo, 2023. "An Exact Approach for Selecting Pickup-Delivery Stations in Urban Areas to Reduce Distribution Emission Costs," Mathematics, MDPI, vol. 11(8), pages 1-18, April.
    4. Katarina Mostarac & Petar Mostarac & Zvonko Kavran & Dragana Šarac, 2022. "Determining Optimal Locations of Postal Access Points Based on Simulated Annealing," Sustainability, MDPI, vol. 14(14), pages 1-17, July.

    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. 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.
    2. 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.
    3. 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.
    4. Schaefer, Jaclyn S. & Figliozzi, Miguel A., 2021. "Spatial accessibility and equity analysis of Amazon parcel lockers facilities," Journal of Transport Geography, Elsevier, vol. 97(C).
    5. Buldeo Rai, Heleen & Verlinde, Sara & Macharis, Cathy, 2021. "Unlocking the failed delivery problem? Opportunities and challenges for smart locks from a consumer perspective," Research in Transportation Economics, Elsevier, vol. 87(C).
    6. Ranjbari, Andisheh & Diehl, Caleb & Dalla Chiara, Giacomo & Goodchild, Anne, 2023. "Do parcel lockers reduce delivery times? Evidence from the field," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
    7. Schwerdfeger, Stefan & Boysen, Nils, 2020. "Optimizing the changing locations of mobile parcel lockers in last-mile distribution," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1077-1094.
    8. Roberta Alves & Renato da Silva Lima & Leise Kelli De Oliveira & Alexandre Ferreira de Pinho, 2022. "Conceptual Framework for Evaluating E-Commerce Deliveries Using Agent-Based Modelling and Sensitivity Analysis," Sustainability, MDPI, vol. 14(23), pages 1-18, November.
    9. Liyun Lin & Haoying Han & Wanglin Yan & Shun Nakayama & Xianfan Shu, 2019. "Measuring Spatial Accessibility to Pick-Up Service Considering Differentiated Supply and Demand: A Case in Hangzhou, China," Sustainability, MDPI, vol. 11(12), pages 1-22, June.
    10. Mancini, Simona & Gansterer, Margaretha & Triki, Chefi, 2023. "Locker box location planning under uncertainty in demand and capacity availability," Omega, Elsevier, vol. 120(C).
    11. 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.
    12. Christian Tilk & Katharina Olkis & Stefan Irnich, 2021. "The last-mile vehicle routing problem with delivery options," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 877-904, December.
    13. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    14. Mashalah, Heider Al & Hassini, Elkafi & Gunasekaran, Angappa & Bhatt (Mishra), Deepa, 2022. "The impact of digital transformation on supply chains through e-commerce: Literature review and a conceptual framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    15. Nils Boysen & Stefan Fedtke & Stefan Schwerdfeger, 2021. "Last-mile delivery concepts: a survey from an operational research perspective," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 1-58, March.
    16. Lin, Yunhui & Wang, Yuan & Lee, Loo Hay & Chew, Ek Peng, 2022. "Profit-maximizing parcel locker location problem under threshold Luce model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    17. Lin, Yun Hui & Wang, Yuan & He, Dongdong & Lee, Loo Hay, 2020. "Last-mile delivery: Optimal locker location under multinomial logit choice model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    18. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    19. Snežana Tadić & Mladen Krstić & Ljubica Radovanović, 2024. "Assessing Strategies to Overcome Barriers for Drone Usage in Last-Mile Logistics: A Novel Hybrid Fuzzy MCDM Model," Mathematics, MDPI, vol. 12(3), pages 1-25, January.
    20. Fagui Liu & Lvshengbiao Wang & Mengke Gui & Yang Zhang & Yulin Lan & Chengqi Lai & Boyuan Zhu, 2023. "A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window," Journal of Heuristics, Springer, vol. 29(2), pages 269-311, June.

    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:jmathe:v:10:y:2022:i:6:p:920-:d:770261. 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.