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

An algorithm for flexible transshipments with perfect synchronization

Author

Listed:
  • Falkenberg, Sven F.
  • Spinler, Stefan
  • Strauss, Arne K.

Abstract

Direct and instant deliveries have gained popularity among customers, but have also increased the burden on cities due to rising transport incidents, especially as delivery vehicles often drive empty when returning to their origin. Flexible transshipments with perfect synchronization would allow loads to be transshiped between these vehicles without the need for storage facilities. This may increase their average proximity to their origin and reduce the proportion of empty rides. We present a problem-specific algorithm with three sub-steps to solve this concept. The first evaluates the relational position between two deliveries and, based on 36 structured cases, decides which pairs to exclude from the solution space. The second formulates the optimization problem to find the best transshipment location while considering time-limit constraints and transfer times. Finally, we apply the request-pair combination problem to graph theory to determine the lowest overall travel time. In our paper, we consider a continuous problem definition which allows flexible transshipments, and assume unit-sized capacity per vehicle and a maximum of one transshipment per request.

Suggested Citation

  • Falkenberg, Sven F. & Spinler, Stefan & Strauss, Arne K., 2024. "An algorithm for flexible transshipments with perfect synchronization," European Journal of Operational Research, Elsevier, vol. 315(3), pages 913-925.
    • Handle: RePEc:eee:ejores:v:315:y:2024:i:3:p:913-925
    DOI: 10.1016/j.ejor.2023.12.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172300913X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.12.003?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. G. Guastaroba & M. G. Speranza & D. Vigo, 2016. "Intermediate Facilities in Freight Transportation Planning: A Survey," Transportation Science, INFORMS, vol. 50(3), pages 763-789, August.
    2. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    3. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    4. Reinhardt, Line Blander & Clausen, Tommy & Pisinger, David, 2013. "Synchronized dial-a-ride transportation of disabled passengers at airports," European Journal of Operational Research, Elsevier, vol. 225(1), pages 106-117.
    5. Wolfinger, David & Salazar-González, Juan-José, 2021. "The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach," European Journal of Operational Research, Elsevier, vol. 289(2), pages 470-484.
    6. H.L.M. Kerivin & M. Lacroix & A.R. Mahjoub & A. Quilliot, 2008. "The splittable pickup and delivery problem with reloads," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 2(2), pages 112-133.
    7. Sam Thangiah & Adel Fergany & Salman Awan, 2007. "Real-time split-delivery pickup and delivery time window problems with transfers," 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. 15(4), pages 329-349, November.
    8. Zhen, Lu & Wu, Yiwei & Wang, Shuaian & Yi, Wen, 2021. "Crowdsourcing mode evaluation for parcel delivery service platforms," International Journal of Production Economics, Elsevier, vol. 235(C).
    9. Rincon-Garcia, Nicolas & Waterson, Ben & Cherrett, Tom J. & Salazar-Arrieta, Fernando, 2020. "A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 429-446.
    10. Wei Zhou & Jane Lin, 2019. "An On-Demand Same-Day Delivery Service Using Direct Peer-to-Peer Transshipment Strategies," Networks and Spatial Economics, Springer, vol. 19(2), pages 409-443, June.
    11. Renaud Masson & Fabien Lehuédé & Olivier Péton, 2013. "An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers," Transportation Science, INFORMS, vol. 47(3), pages 344-355, August.
    12. Rais, A. & Alvelos, F. & Carvalho, M.S., 2014. "New mixed integer-programming model for the pickup-and-delivery problem with transshipment," European Journal of Operational Research, Elsevier, vol. 235(3), pages 530-539.
    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. Wolfinger, David & Salazar-González, Juan-José, 2021. "The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach," European Journal of Operational Research, Elsevier, vol. 289(2), pages 470-484.
    2. Fu, Zhexi & Chow, Joseph Y.J., 2022. "The pickup and delivery problem with synchronized en-route transfers for microtransit planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    3. Lyu, Zefeng & Yu, Andrew Junfang, 2023. "The pickup and delivery problem with transshipments: Critical review of two existing models and a new formulation," European Journal of Operational Research, Elsevier, vol. 305(1), pages 260-270.
    4. David Wolfinger & Fabien Tricoire & Karl F. Doerner, 2019. "A matheuristic for a multimodal long haul routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 397-433, December.
    5. Masson, Renaud & Ropke, Stefan & Lehuédé, Fabien & Péton, Olivier, 2014. "A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes," European Journal of Operational Research, Elsevier, vol. 236(3), pages 849-862.
    6. Paul Buijs & Jose Alejandro Lopez Alvarez & Marjolein Veenstra & Kees Jan Roodbergen, 2016. "Improved Collaborative Transport Planning at Dutch Logistics Service Provider Fritom," Interfaces, INFORMS, vol. 46(2), pages 119-132, April.
    7. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    8. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    9. Bettinelli, Andrea & Cacchiani, Valentina & Crainic, Teodor Gabriel & Vigo, Daniele, 2019. "A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities," European Journal of Operational Research, Elsevier, vol. 279(3), pages 824-839.
    10. Renaud Masson & Fabien Lehuédé & Olivier Péton, 2013. "An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers," Transportation Science, INFORMS, vol. 47(3), pages 344-355, August.
    11. Gandra, Vinícius S.M. & Çalık, Hatice & Toffolo, Túlio A.M. & Carvalho, Marco Antonio M. & Vanden Berghe, Greet, 2022. "The vessel swap-body routing problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 354-369.
    12. Soares, Ricardo & Marques, Alexandra & Amorim, Pedro & Parragh, Sophie N., 2024. "Synchronisation in vehicle routing: Classification schema, modelling framework and literature review," European Journal of Operational Research, Elsevier, vol. 313(3), pages 817-840.
    13. Guo, Yuhan & Zhang, Yu & Boulaksil, Youssef, 2021. "Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration," European Journal of Operational Research, Elsevier, vol. 288(3), pages 810-828.
    14. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    15. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    16. Yildiz, Hakan & Ravi, R. & Fairey, Wayne, 2010. "Integrated optimization of customer and supplier logistics at Robert Bosch LLC," European Journal of Operational Research, Elsevier, vol. 207(1), pages 456-464, November.
    17. Philippe Grangier & Michel Gendreau & Fabien Lehuédé & Louis-Martin Rousseau, 2021. "The vehicle routing problem with cross-docking and resource constraints," Journal of Heuristics, Springer, vol. 27(1), pages 31-61, April.
    18. Johnsen, Lennart C. & Meisel, Frank, 2022. "Interrelated trips in the rural dial-a-ride problem with autonomous vehicles," European Journal of Operational Research, Elsevier, vol. 303(1), pages 201-219.
    19. Wei Zhou & Jane Lin, 2019. "An On-Demand Same-Day Delivery Service Using Direct Peer-to-Peer Transshipment Strategies," Networks and Spatial Economics, Springer, vol. 19(2), pages 409-443, June.
    20. Michael Drexl, 2012. "Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints," Transportation Science, INFORMS, vol. 46(3), pages 297-316, August.

    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:315:y:2024:i:3:p:913-925. 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.