IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v201y2025ics1366554525002728.html
   My bibliography  Save this article

To ride or to fly: Optimal freight-on-transit operations using drones

Author

Listed:
  • Osorio, Jesus
  • Ouyang, Yanfeng

Abstract

With the rapid growth of e-commerce, urban areas are facing increasing congestion, particularly from last-mile deliveries. This challenge has prompted the exploration of innovative solutions. One such promising approach is freight-on-transit (FoT) operations, which utilize existing high-capacity urban transit networks to transport goods to designated transit stations, where more energy-efficient and flexible modes complete the last-mile delivery. This paper proposes a modeling framework for optimizing FoT operations using drones. The proposed mixed-integer linear program formulation accounts for fixed transit vehicle schedules, capacity constraints, and drone battery limitations. The problem is decomposed into a min-cost flow and drone vehicle routing problem with time windows, and a Lagrangian relaxation with a column generation algorithm is proposed as the solution method. Numerical experiments on hypothetical networks demonstrate the system’s effectiveness, highlighting the importance of buffer capacity in transit vehicles and extended drone battery life. A real-world case study in Chicago’s Metra system reveals significant cost savings and operational benefits compared to traditional truck-based or drone-only delivery methods.

Suggested Citation

  • Osorio, Jesus & Ouyang, Yanfeng, 2025. "To ride or to fly: Optimal freight-on-transit operations using drones," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).
  • Handle: RePEc:eee:transe:v:201:y:2025:i:c:s1366554525002728
    DOI: 10.1016/j.tre.2025.104231
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2025.104231?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:transe:v:201:y:2025:i:c:s1366554525002728. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.