IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v17y2025i17p7937-d1741376.html
   My bibliography  Save this article

Multimodal Transport Optimization from Doorstep to Airport Using Mixed-Integer Linear Programming and Dynamic Programming

Author

Listed:
  • Evangelos D. Spyrou

    (Hellenic Institute of Transport, Centre for Research and Technology Hellas, Thermi, 57001 Thessaloniki, Greece)

  • Vassilios Kappatos

    (Hellenic Institute of Transport, Centre for Research and Technology Hellas, Thermi, 57001 Thessaloniki, Greece)

  • Maria Gkemou

    (Hellenic Institute of Transport, Centre for Research and Technology Hellas, Thermi, 57001 Thessaloniki, Greece)

  • Evangelos Bekiaris

    (Hellenic Institute of Transport, Centre for Research and Technology Hellas, Thermi, 57001 Thessaloniki, Greece)

Abstract

Efficient multimodal transportation from a passenger’s doorstep to the airport is critical for ensuring timely arrivals, reducing travel uncertainty, and optimizing overall travel experience. However, coordinating different modes of transport—such as walking, public transit, ride-hailing, and private vehicles—poses significant challenges due to varying schedules, traffic conditions, and transfer times. Traditional route planning methods often fail to account for real-time disruptions, leading to delays and inefficiencies. As air travel demand grows, optimizing these multimodal routes becomes increasingly important to minimize delays, improve passenger convenience, and enhance transport system resilience. To address this challenge, we propose an optimization framework combining Mixed-Integer Linear Programming (MILP) and Dynamic Programming (DP) to generate optimal travel routes from a passenger’s location to the airport gate. MILP is used to model and optimize multimodal trip decisions, considering time windows, cost constraints, and transfer dependencies. Meanwhile, DP allows for adaptive, real-time adjustments based on changing conditions such as traffic congestion, transit delays, and service availability. By integrating these two techniques, our approach ensures a robust, efficient, and scalable solution for multimodal transport routing, ultimately enhancing reliability and reducing travel time variability. The results demonstrate that the MILP solver converges within 20 iterations, reducing the objective value from 15.2 to 7.1 units with an optimality gap of 8.5%; the DP-based adaptation maintains feasibility under a 2 min disruption; and the multimodal analysis yields a total travel time of 9.0 min with a fare of 3.0 units, where the bus segment accounts for 6.5 min and 2.2 units of the total. In the multimodal transport evaluation, DP adaptation reduced cumulative delays by more than half after disruptions, while route selection demonstrated balanced trade-offs between cost and time across walking, bus, and train segments.

Suggested Citation

  • Evangelos D. Spyrou & Vassilios Kappatos & Maria Gkemou & Evangelos Bekiaris, 2025. "Multimodal Transport Optimization from Doorstep to Airport Using Mixed-Integer Linear Programming and Dynamic Programming," Sustainability, MDPI, vol. 17(17), pages 1-15, September.
  • Handle: RePEc:gam:jsusta:v:17:y:2025:i:17:p:7937-:d:1741376
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/17/17/7937/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/17/17/7937/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:gam:jsusta:v:17:y:2025:i:17:p:7937-:d:1741376. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.