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

A two-echelon vehicle routing problem with mobile satellites and multiple commodities

Author

Listed:
  • Dahimi, Aria
  • Lurkin, Virginie
  • Mohammadi, Mehrdad
  • Van Woensel, Tom

Abstract

This paper extends the two-echelon vehicle routing problem (2E-VRP) by considering multiple commodities, multiple depots, and mobile satellites (i.e., the so-called 3M-2E-VRP). This problem also accommodates flexible last-mile delivery strategies by allowing direct deliveries via first-echelon vehicles (mobile satellites) and indirect deliveries through goods exchanges at meeting points, such as parking lots or customer locations. We first model the problem as a mixed-integer linear programming (MILP); and then develop an innovative metaheuristic algorithm to solve medium and large problem instances. The proposed metaheuristic (the so-called AS-LNS) combines an innovative Approximate Scheduling (AS) approach with Large Neighborhood Search (LNS). Computational experiments validate the 3M-2E-VRP formulation and demonstrate the effectiveness of the proposed AS-LNS algorithm. Key managerial insights are further presented through a comprehensive sensitivity analysis, wherein the impact of key parameters, such as fuel consumption and wage costs, and comparison of different problem variants, is investigated on last-mile delivery strategies.

Suggested Citation

  • Dahimi, Aria & Lurkin, Virginie & Mohammadi, Mehrdad & Van Woensel, Tom, 2025. "A two-echelon vehicle routing problem with mobile satellites and multiple commodities," European Journal of Operational Research, Elsevier, vol. 326(1), pages 124-140.
    • Handle: RePEc:eee:ejores:v:326:y:2025:i:1:p:124-140
    DOI: 10.1016/j.ejor.2025.04.027
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725002978
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.04.027?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:326:y:2025:i:1:p:124-140. 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.