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

The traveling salesman problem with drone based on vehicle mobile parking for customer self-pickup

Author

Listed:
  • Hong, Lingrui
  • Zhou, Lin
  • Baldacci, Roberto

Abstract

This paper introduces the traveling salesman problem with drone based on vehicle mobile parking for customer self-pickup (TSPD-VMPCP) in last-mile delivery. A set of vertices is considered, including a depot, parking spots, home delivery (HD) customers that must be visited directly within predefined time windows by truck or drone, and customers with self-pickup (CP) preference that must be served by designated parking spots. Specifically, we allow the drone to perform multi-loop, in which the drone launches and lands at the same location. CP customers are covered using a probability function based on their self-pickup behavior and the truck’s stoppage duration. The TSPD-VMPCP aims to minimize the total operating cost. We model the TSPD-VMPCP as a mixed-integer linear program and develop an adaptive large neighborhood search (ALNS) metaheuristic, in addition to a two-phase local search (2P-LS) based on variable neighborhood descent (VND) and matheuristic. We assess the performance of ALNS by comparing it with the Gurobi solver on small instances. The numerical results for medium and large instances highlight the effectiveness of the various components of the ALNS. Furthermore, we provide some managerial insights.

Suggested Citation

  • Hong, Lingrui & Zhou, Lin & Baldacci, Roberto, 2025. "The traveling salesman problem with drone based on vehicle mobile parking for customer self-pickup," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 203(C).
    • Handle: RePEc:eee:transe:v:203:y:2025:i:c:s1366554525003886
    DOI: 10.1016/j.tre.2025.104347
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525003886
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2025.104347?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. Wu, Yuehui & Qureshi, Ali Gul & Yamada, Tadashi, 2022. "Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1113-1127.
    2. 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.
    3. Yang, Yu & Yan, Chiwei & Cao, Yufeng & Roberti, Roberto, 2023. "Planning robust drone-truck delivery routes under road traffic uncertainty," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1145-1160.
    4. Yu, Vincent F. & Jodiawan, Panca & Hou, Ming-Lu & Gunawan, Aldy, 2021. "Design of a two-echelon freight distribution system in last-mile logistics considering covering locations and occasional drivers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    5. Karaoğlan, İsmail & Erdoğan, Güneş & Koç, Çağrı, 2018. "The Multi-Vehicle Probabilistic Covering Tour Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 278-287.
    6. 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.
    7. Yin, Yunqiang & Li, Dongwei & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Wang, Sutong, 2023. "A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1125-1144.
    8. Moshref-Javadi, Mohammad & Lee, Seokcheon & Winkenbach, Matthias, 2020. "Design and evaluation of a multi-trip delivery model with truck and drones," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    9. Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, August.
    10. Doppstadt, Christian & Koberstein, Achim & Vigo, Daniele, 2020. "The Hybrid Electric Vehicle—Traveling Salesman Problem with time windows," European Journal of Operational Research, Elsevier, vol. 284(2), pages 675-692.
    11. Stein, William E. & Pfaffenberger, Roger C. & Mizzi, Philip J., 1993. "A stochastic dominance comparison of truncated normal distributions," European Journal of Operational Research, Elsevier, vol. 67(2), pages 259-266, June.
    12. Zhang, Wenwei & Xu, Min & Wang, Shuaian, 2023. "Joint location and pricing optimization of self-service in urban logistics considering customers’ choice behavior," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    13. Wang, Zheng & Sheu, Jiuh-Biing, 2019. "Vehicle routing problem with drones," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 350-364.
    14. Li, Hongqi & Chen, Jun & Wang, Feilong & Bai, Ming, 2021. "Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: A review," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1078-1095.
    15. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    16. G. A. Croes, 1958. "A Method for Solving Traveling-Salesman Problems," Operations Research, INFORMS, vol. 6(6), pages 791-812, December.
    17. Liu, Zeyu & Li, Xueping & Khojandi, Anahita, 2022. "The flying sidekick traveling salesman problem with stochastic travel time: A reinforcement learning approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    18. Roberto Roberti & Mario Ruthmair, 2021. "Exact Methods for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 55(2), pages 315-335, March.
    19. A Ghoniem & C R Scherrer & S Solak, 2013. "A specialized column generation approach for a vehicle routing problem with demand allocation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(1), pages 114-124, January.
    20. Niels Agatz & Paul Bouman & Marie Schmidt, 2018. "Optimization Approaches for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 52(4), pages 965-981, August.
    21. Madani, Batool & Ndiaye, Malick & Salhi, Said, 2024. "Hybrid truck-drone delivery system with multi-visits and multi-launch and retrieval locations: Mathematical model and adaptive variable neighborhood search with neighborhood categorization," European Journal of Operational Research, Elsevier, vol. 316(1), pages 100-125.
    22. Rave, Alexander & Fontaine, Pirmin & Kuhn, Heinrich, 2023. "Drone location and vehicle fleet planning with trucks and aerial drones," European Journal of Operational Research, Elsevier, vol. 308(1), pages 113-130.
    23. 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.
    24. John R. Current & David A. Schilling, 1989. "The Covering Salesman Problem," Transportation Science, INFORMS, vol. 23(3), pages 208-213, August.
    25. R. Baldacci & M. Dell'Amico & J. Salazar González, 2007. "The Capacitated m -Ring-Star Problem," Operations Research, INFORMS, vol. 55(6), pages 1147-1162, December.
    26. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    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. Ramadhan, Fadillah & Irawan, Chandra Ade & Salhi, Said & Cai, Zhao, 2025. "The truck traveling salesman problem with drone and boat for humanitarian relief distribution in flood disaster: Mathematical model and solution methods," European Journal of Operational Research, Elsevier, vol. 322(1), pages 270-291.
    2. Yang, Hongtai & Wu, Jianzhang & Zhang, Zhaolin & Liu, Xiaobo & D’Ariano, Andrea, 2025. "Optimal design for an urban truck-drone collaborative delivery system enhanced with relay points," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).
    3. Yu, Shaohua & Puchinger, Jakob & Sun, Shudong, 2022. "Van-based robot hybrid pickup and delivery routing problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 894-914.
    4. Zhao, Lei & Bi, Xinhua & Li, Gendao & Dong, Zhaohui & Xiao, Ni & Zhao, Anni, 2022. "Robust traveling salesman problem with multiple drones: Parcel delivery under uncertain navigation environments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    5. Wang, Feilong & Li, Hongqi & Xiong, Hanxi, 2025. "Truck–drone routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 322(3), pages 854-869.
    6. Chen, Enming & Zhou, Zhongbao & Li, Ruiyang & Chang, Zhongxiang & Shi, Jianmai, 2024. "The multi-fleet delivery problem combined with trucks, tricycles, and drones for last-mile logistics efficiency requirements under multiple budget constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 187(C).
    7. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    8. Ren, Xuan & Froger, Aurélien & Jabali, Ola & Liang, Gongqian, 2024. "A competitive heuristic algorithm for vehicle routing problems with drones," European Journal of Operational Research, Elsevier, vol. 318(2), pages 469-485.
    9. Yu, Shaohua & Puchinger, Jakob & Sun, Shudong, 2024. "Electric van-based robot deliveries with en-route charging," European Journal of Operational Research, Elsevier, vol. 317(3), pages 806-826.
    10. Madani, Batool & Ndiaye, Malick & Salhi, Said, 2024. "Hybrid truck-drone delivery system with multi-visits and multi-launch and retrieval locations: Mathematical model and adaptive variable neighborhood search with neighborhood categorization," European Journal of Operational Research, Elsevier, vol. 316(1), pages 100-125.
    11. Meng, Shanshan & Li, Dong & Liu, Jiyin & Chen, Yanru, 2024. "The multi-visit drone-assisted routing problem with soft time windows and stochastic truck travel times," Transportation Research Part B: Methodological, Elsevier, vol. 190(C).
    12. Meng, Shanshan & Chen, Yanru & Li, Dong, 2024. "The multi-visit drone-assisted pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 314(2), pages 685-702.
    13. Zhou, Hang & Qin, Hu & Cheng, Chun & Rousseau, Louis-Martin, 2023. "An exact algorithm for the two-echelon vehicle routing problem with drones," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 124-150.
    14. Dursunoglu, Cagla F. & Arslan, Okan & Demir, Sebnem Manolya & Kara, Bahar Y. & Laporte, Gilbert, 2025. "A unifying framework for selective routing problems," European Journal of Operational Research, Elsevier, vol. 320(1), pages 1-19.
    15. Zang, Xiaoning & Jiang, Li & Liang, Changyong & Fang, Xiang, 2023. "Coordinated home and locker deliveries: An exact approach for the urban delivery problem with conflicting time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    16. Zhu, Waiming & Hu, Xiaoxuan & Pei, Jun & Pardalos, Panos M., 2024. "Minimizing the total travel distance for the locker-based drone delivery: A branch-and-cut-based method," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    17. Lyu, Mingzhi & Liu, Wei & He, Qingying & Wu, Lingxiao, 2025. "Urban food delivery service optimisation with coordinated delivery riders and drones," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).
    18. Peng, Wenhao & Wang, Dujuan & Yin, Yunqiang & Cheng, T.C.E., 2025. "Multi-agent deep reinforcement learning-based truck-drone collaborative routing with dynamic emergency response," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 195(C).
    19. Shi, Zhiyuan & Hong, Shaozhi & Wang, Zeling & Li, Ang, 2026. "Exact solution approaches for the traveling salesman problem with a drone station," European Journal of Operational Research, Elsevier, vol. 328(3), pages 845-861.
    20. 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.

    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:203:y:2025:i:c:s1366554525003886. 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.