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

Multi-attribute two-echelon location routing: Formulation and dynamic discretization discovery approach

Author

Listed:
  • Escobar-Vargas, David
  • Crainic, Teodor Gabriel

Abstract

We study the two-echelon location-routing system under tight synchronization constraints, in addition to several other interacting attributes. Prompted, in particular, by city-logistics applications, the system we address concerns a two-echelon distribution layout composed of a set of platform facilities and a set of intermediate satellite facilities to deliver freight from supply zones outside the city to customers within. The problem setting includes time-dependent multicommodity demand, time windows, lack of storage capacity at intermediate facilities, and synchronization at these facilities of the fleets operating on different echelons. The problem requires the selection of facilities at both levels, the allocation of suppliers to platforms and of customers to satellites, and the routing and scheduling of vehicles at each echelon, in order to deliver the freight from platforms to customers, through the satellites. The lack of storage capacity of the shared facilities, the satellites, requires tight scheduling of the vehicle routes and demand itineraries, i.e., departure times from the platforms and satellites, and the synchronization of vehicle routes at satellites for efficient transshipment operations. We introduce the problem setting, present a mixed-integer programming formulation, and a dynamic discretization discovery-based exact solution method for the problem. We perform thorough analyses to assess the impact of the problem attributes and requirements on the system behaviour and algorithm performance.

Suggested Citation

  • Escobar-Vargas, David & Crainic, Teodor Gabriel, 2024. "Multi-attribute two-echelon location routing: Formulation and dynamic discretization discovery approach," European Journal of Operational Research, Elsevier, vol. 314(1), pages 66-78.
  • Handle: RePEc:eee:ejores:v:314:y:2024:i:1:p:66-78
    DOI: 10.1016/j.ejor.2023.09.031
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2023.09.031?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:314:y:2024:i:1:p:66-78. 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.