IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v316y2022i2d10.1007_s10479-020-03789-0.html
   My bibliography  Save this article

A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem

Author

Listed:
  • Juan D. Palacio

    (Universidad EAFIT)

  • Juan Carlos Rivera

    (Universidad EAFIT)

Abstract

This article addresses the one-commodity pickup and delivery traveling salesman problem (1-PDTSP), which is a generalization of the well-known traveling salesman problem. The 1-PDTSP aims to find a Hamiltonian tour in which a set of supply points (pickup locations), demand points (delivery locations) are visited and, the total traveled distance is minimized. We propose a hybrid metaheuristic based on multi-start evolutionary local search and variable neighborhood descent to solve the 1-PDTSP. To test the performance of our algorithm, we solve instances with up to 500 nodes available in the literature and we demonstrate that our approach is able to provide competitive results when comparing to other existing strategies. Since a direct application of the 1-PDTSP arises as the bicycle repositioning problem, we also use our metaheuristic algorithm to solve a set of real-case instances based on EnCicla, the bicycle sharing system in the Aburrá Valley (Antioquia, Colombia).

Suggested Citation

  • Juan D. Palacio & Juan Carlos Rivera, 2022. "A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem," Annals of Operations Research, Springer, vol. 316(2), pages 979-1011, September.
  • Handle: RePEc:spr:annopr:v:316:y:2022:i:2:d:10.1007_s10479-020-03789-0
    DOI: 10.1007/s10479-020-03789-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03789-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-020-03789-0?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Legros, Benjamin, 2019. "Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station," European Journal of Operational Research, Elsevier, vol. 272(2), pages 740-753.
    2. Zhang, Dong & Yu, Chuhang & Desai, Jitamitra & Lau, H.Y.K. & Srivathsan, Sandeep, 2017. "A time-space network flow approach to dynamic repositioning in bicycle sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 188-207.
    3. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    4. G Babin & S Deneault & G Laporte, 2007. "Improvements to the Or-opt heuristic for the symmetric travelling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 402-407, March.
    5. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    6. Mladenović, Nenad & Urošević, Dragan & Hanafi, Saı¨d & Ilić, Aleksandar, 2012. "A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 270-285.
    7. Ho, Sin C. & Szeto, W.Y., 2017. "A hybrid large neighborhood search for the static multi-vehicle bike-repositioning problem," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 340-363.
    8. Dell'Amico, Mauro & Hadjicostantinou, Eleni & Iori, Manuel & Novellani, Stefano, 2014. "The bike sharing rebalancing problem: Mathematical formulations and benchmark instances," Omega, Elsevier, vol. 45(C), pages 7-19.
    9. José-Manuel Belenguer & Enrique Benavent & Nacima Labadi & Christian Prins & Mohamed Reghioui, 2010. "Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic," Transportation Science, INFORMS, vol. 44(2), pages 206-220, May.
    10. Forma, Iris A. & Raviv, Tal & Tzur, Michal, 2015. "A 3-step math heuristic for the static repositioning problem in bike-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 230-247.
    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. Dell’Amico, Mauro & Iori, Manuel & Novellani, Stefano & Subramanian, Anand, 2018. "The Bike sharing Rebalancing Problem with Stochastic Demands," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 362-380.
    2. Lv, Chang & Zhang, Chaoyong & Lian, Kunlei & Ren, Yaping & Meng, Leilei, 2020. "A hybrid algorithm for the static bike-sharing re-positioning problem based on an effective clustering strategy," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 1-21.
    3. Ye Ding & Jiantong Zhang & Jiaqing Sun, 2022. "Branch-and-Price-and-Cut for the Heterogeneous Fleet and Multi-Depot Static Bike Rebalancing Problem with Split Load," Sustainability, MDPI, vol. 14(17), pages 1-24, August.
    4. Carlos M. Vallez & Mario Castro & David Contreras, 2021. "Challenges and Opportunities in Dock-Based Bike-Sharing Rebalancing: A Systematic Review," Sustainability, MDPI, vol. 13(4), pages 1-26, February.
    5. Lv, Chang & Zhang, Chaoyong & Lian, Kunlei & Ren, Yaping & Meng, Leilei, 2022. "A two-echelon fuzzy clustering based heuristic for large-scale bike sharing repositioning problem," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 54-75.
    6. Lei, Chao & Ouyang, Yanfeng, 2018. "Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 90-109.
    7. Du, Mingyang & Cheng, Lin & Li, Xuefeng & Tang, Fang, 2020. "Static rebalancing optimization with considering the collection of malfunctioning bikes in free-floating bike sharing system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    8. Osorio, Jesus & Lei, Chao & Ouyang, Yanfeng, 2021. "Optimal rebalancing and on-board charging of shared electric scooters," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 197-219.
    9. Chang, Ximing & Wu, Jianjun & Sun, Huijun & Correia, Gonçalo Homem de Almeida & Chen, Jianhua, 2021. "Relocating operational and damaged bikes in free-floating systems: A data-driven modeling framework for level of service enhancement," Transportation Research Part A: Policy and Practice, Elsevier, vol. 153(C), pages 235-260.
    10. Gilbert Laporte & Frédéric Meunier & Roberto Wolfler Calvo, 2018. "Shared mobility systems: an updated survey," Annals of Operations Research, Springer, vol. 271(1), pages 105-126, December.
    11. Xue Bai & Ning Ma & Kwai-Sang Chin, 2022. "Hybrid Heuristic for the Multi-Depot Static Bike Rebalancing and Collection Problem," Mathematics, MDPI, vol. 10(23), pages 1-28, December.
    12. Huang, Di & Chen, Xinyuan & Liu, Zhiyuan & Lyu, Cheng & Wang, Shuaian & Chen, Xuewu, 2020. "A static bike repositioning model in a hub-and-spoke network framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    13. Wang, Yi-Jia & Kuo, Yong-Hong & Huang, George Q. & Gu, Weihua & Hu, Yaohua, 2022. "Dynamic demand-driven bike station clustering," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    14. Fu, Chenyi & Zhu, Ning & Ma, Shoufeng & Liu, Ronghui, 2022. "A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems," European Journal of Operational Research, Elsevier, vol. 298(3), pages 915-938.
    15. Li, Yanfeng & Liu, Yang, 2021. "The static bike rebalancing problem with optimal user incentives," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    16. Yongji Jia & Wang Zeng & Yanting Xing & Dong Yang & Jia Li, 2020. "The Bike-Sharing Rebalancing Problem Considering Multi-Energy Mixed Fleets and Traffic Restrictions," Sustainability, MDPI, vol. 13(1), pages 1-15, December.
    17. Liang Gao & Wei Xu & Yifeng Duan, 2019. "Dynamic Scheduling Based on Predicted Inventory Variation Rate for Public Bicycle System," Sustainability, MDPI, vol. 11(7), pages 1-11, March.
    18. Hernández-Pérez, Hipólito & Salazar-González, Juan-José, 2022. "A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 297(2), pages 467-483.
    19. Cheng, Yao & Wang, Junwei & Wang, Yan, 2021. "A user-based bike rebalancing strategy for free-floating bike sharing systems: A bidding model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    20. Fu, Chenyi & Ma, Shoufeng & Zhu, Ning & He, Qiao-Chu & Yang, Hai, 2022. "Bike-sharing inventory management for market expansion," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 28-54.

    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:spr:annopr:v:316:y:2022:i:2:d:10.1007_s10479-020-03789-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.