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.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.