IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-79409-7_41.html
   My bibliography  Save this book chapter

Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm

In: Modeling, Simulation and Optimization of Complex Processes

Author

Listed:
  • Chotiros Surapholchai

    (Chulalongkorn University, Department of Mathematics)

  • Gerhard Reinelt

    (University of Heidelberg, Institute of Computer Science)

  • Hans Georg Bock

    (University of Heidelberg, Interdisciplinary Center for Scientific Computing (IWR))

Abstract

The modeling of city bus scheduling problems is considered to optimize the number of buses and their scheduling in the city. The vehicle scheduling problem (VSP) can be solved by some heuristic algorithms. The disadvantage of these algorithms is that the solution quality decreases as the number of depots increases. Therefore, in this paper, we develop the Eligen-algorithm, which uses the techniques of column elimination and column generation, for solving the multiple-depot vehicle scheduling problems (MDVSPs). The advantage of this algorithm is that the solution quality improves as the number of depots grows. Moreover, this algorithm is faster and gives better solutions than the nearest bus-stop heuristic algorithm (NB) and the joined nearest bus-stop heuristic algorithm (JNB) which we developed before. For example problem instance, we use the modeling of city bus scheduling problem in Bangkok, Thailand.

Suggested Citation

  • Chotiros Surapholchai & Gerhard Reinelt & Hans Georg Bock, 2008. "Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm," Springer Books, in: Hans Georg Bock & Ekaterina Kostina & Hoang Xuan Phu & Rolf Rannacher (ed.), Modeling, Simulation and Optimization of Complex Processes, pages 557-564, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-79409-7_41
    DOI: 10.1007/978-3-540-79409-7_41
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    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:spr:sprchp:978-3-540-79409-7_41. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.