IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v53y2025i3p269-286.html
   My bibliography  Save this article

Mixed integer programming formulations for multi-depot bus scheduling problem in Quito

Author

Listed:
  • Fernanda Salazar
  • Ramiro Torres

Abstract

In this work the multi-depot bus scheduling problem is considered. The problem consists in assigning a set of timetabled trips characterised by an origin depot with a departure time as well as a destination depot with an arrival time to feasible bus routes. Moreover, the selected bus routes must satisfy that each trip is covered exactly by one route, each bus has to return back to its original depot at the end of the working day, the available heterogeneous bus fleet is not exceeded and a certain cost function is minimised. Two different linear integer programming formulations are proposed. The first approach is closely related to arc-based models where all possible compatible trip connections are considered explicitly leading to a multi-commodity flow formulation, whereas the latter is defined on a time-space network based on aggregation of possible connection arcs allowing to route several trips on one single arc simultaneously, which avoids the explosive increase of the model size with a growing timetable. Some lower bounds are provided for both formulations and computational results based on simulated and real-world instances are reported.

Suggested Citation

  • Fernanda Salazar & Ramiro Torres, 2025. "Mixed integer programming formulations for multi-depot bus scheduling problem in Quito," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 53(3), pages 269-286.
  • Handle: RePEc:ids:ijores:v:53:y:2025:i:3:p:269-286
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=146962
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    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:ids:ijores:v:53:y:2025:i:3:p:269-286. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.