IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v289y2021i3p897-911.html
   My bibliography  Save this article

A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem

Author

Listed:
  • Casazza, Marco
  • Ceselli, Alberto
  • Wolfler Calvo, Roberto

Abstract

We address a single commodity Pickup and Delivery Vehicle Routing Problem from the literature. A network of customer nodes is given with both travel times and costs. A fleet of vehicles of limited capacity is exploited to satisfy node demands, and a set of routes must be found such that the vehicle capacities are never exceeded, each route does not exceed time resource, and cost is minimized. The demands of both pickup and delivery nodes can be split, and each node can be visited more than once. We provide new theoretical insights. We propose a new formulation where routes are decomposed into sequences of simpler substructures called clusters, mitigating the combinatorial explosion of feasible solutions. We introduce valid inequalities, and design a branch-and-price algorithm, exploiting ad hoc pricing routines and branching strategies, and embedding a rounding heuristic to speed up pruning. An extensive experimental analysis shows our method to offer simultaneously more modelling flexibility and more computational effectiveness than previous attempts from the literature. Our investigation opens also interesting insights into the use of route decomposition strategies.

Suggested Citation

  • Casazza, Marco & Ceselli, Alberto & Wolfler Calvo, Roberto, 2021. "A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 897-911.
  • Handle: RePEc:eee:ejores:v:289:y:2021:i:3:p:897-911
    DOI: 10.1016/j.ejor.2019.07.015
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2019.07.015?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. Guy Desaulniers, 2010. "Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 58(1), pages 179-192, February.
    2. Gschwind, Timo & Irnich, Stefan & Rothenbächer, Ann-Kathrin & Tilk, Christian, 2018. "Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 521-530.
    3. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
    4. Marian Rainer-Harbach & Petrina Papazek & Günther Raidl & Bin Hu & Christian Kloimüllner, 2015. "PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems," Journal of Global Optimization, Springer, vol. 63(3), pages 597-629, November.
    5. Bulhões, Teobaldo & Subramanian, Anand & Erdoğan, Güneş & Laporte, Gilbert, 2018. "The static bike relocation problem with multiple vehicles and visits," European Journal of Operational Research, Elsevier, vol. 264(2), pages 508-523.
    6. Moshe Dror & Pierre Trudeau, 1990. "Split delivery routing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(3), pages 383-402, June.
    7. Alvarez-Valdes, Ramon & Belenguer, Jose M. & Benavent, Enrique & Bermudez, Jose D. & Muñoz, Facundo & Vercher, Enriqueta & Verdejo, Francisco, 2016. "Optimizing the level of service quality of a bike-sharing system," Omega, Elsevier, vol. 62(C), pages 163-175.
    8. 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)

    Citations

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


    Cited by:

    1. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    2. Jie Zhang & Yifan Zhu & Tao Wang & Weiping Wang & Rui Wang & Xiaobo Li, 2022. "An Improved Intelligent Auction Mechanism for Emergency Material Delivery," Mathematics, MDPI, vol. 10(13), pages 1-30, June.
    3. Zhen, Lu & Baldacci, Roberto & Tan, Zheyi & Wang, Shuaian & Lyu, Junyan, 2022. "Scheduling heterogeneous delivery tasks on a mixed logistics platform," European Journal of Operational Research, Elsevier, vol. 298(2), pages 680-698.
    4. 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.

    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. 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).
    2. 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.
    3. Guo, Yuhan & Li, Jinning & Xiao, Linfan & Allaoui, Hamid & Choudhary, Alok & Zhang, Lufang, 2024. "Efficient inventory routing for Bike-Sharing Systems: A combinatorial reinforcement learning framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 182(C).
    4. 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.
    5. 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.
    6. 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.
    7. Bulhões, Teobaldo & Subramanian, Anand & Erdoğan, Güneş & Laporte, Gilbert, 2018. "The static bike relocation problem with multiple vehicles and visits," European Journal of Operational Research, Elsevier, vol. 264(2), pages 508-523.
    8. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    9. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    10. Bruno Albert Neumann-Saavedra & Teodor Gabriel Crainic & Bernard Gendron & Dirk Christian Mattfeld & Michael Römer, 2020. "Integrating Resource Management in Service Network Design for Bike-Sharing Systems," Transportation Science, INFORMS, vol. 54(5), pages 1251-1271, September.
    11. 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).
    12. 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.
    13. 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.
    14. Szeto, W.Y. & Shui, C.S., 2018. "Exact loading and unloading strategies for the static multi-vehicle bike repositioning problem," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 176-211.
    15. 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.
    16. Alain Quilliot & Antoine Sarbinowski & Hélène Toussaint, 2021. "Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system," Annals of Operations Research, Springer, vol. 298(1), pages 445-468, March.
    17. 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.
    18. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    19. Sophie N. Parragh & Jorge Pinho de Sousa & Bernardo Almada-Lobo, 2015. "The Dial-a-Ride Problem with Split Requests and Profits," Transportation Science, INFORMS, vol. 49(2), pages 311-334, May.
    20. Jie, Wanchen & Yang, Jun & Zhang, Min & Huang, Yongxi, 2019. "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology," European Journal of Operational Research, Elsevier, vol. 272(3), pages 879-904.

    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:289:y:2021:i:3:p:897-911. 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.