Skip to main content

Constrained Local Search Method for Bus Fleet Scheduling Problem with Multi-depot with Line Change

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4974))

Abstract

This paper proposes a bus fleet scheduling model with multi-depot and line change operations with the aim to reduce the operating costs. The problem is constrained by various practical operational constraints, e.g. headway, travel time, and route time restrictions. A constrained local search method is developed to find better bus schedules. The method is tested with the case study of the Bangkok bus system with nine bus service lines covering around 688 trips per day. The test result shows that around 10% of the total operating costs could be saved by the optimized schedule.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bertossi, A.A., Carraresi, P., Gallo, G.: On some matching problems arising in vehicle scheduling models. Networks 17, 271–281 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ribeiro, C.C., Soumis, F.: A column generation approach to the multiple-depot vehicle scheduling problem. Operations Research 42, 41–52 (1994)

    Article  MATH  Google Scholar 

  3. Lobel, A.: Optimal vehicle scheduling in public transit. PhD thesis, Technische University, Berlin (1997)

    Google Scholar 

  4. Lobel, A.: Vehicle scheduling in public transit and Lagrangian pricing. Management Science 4, 1637–1649 (1998)

    Google Scholar 

  5. Hadjar, A., Marcotte, O., Soumis, F.: A branch and cut algorithm for the multiple depot vehicle scheduling problem. Operations Research 54, 130–149 (2006)

    Article  Google Scholar 

  6. Pepin, A.S., Desaulniers, G., Hertz, A., Huisman, D.: Comparison of heuristic approaches for the multiple depot vehicle scheduling problem. Report EI2006-34, Econometric Institute, Erasmus University Rotterdam (2006)

    Google Scholar 

  7. Kliewer, N., Mellouli, T., Suhl, L.: A time-space network based exact optimization model for multi-depot bus scheduling. European Journal of Operational Research 175(3), 1616–1627 (2006)

    Article  MATH  Google Scholar 

  8. Indra-Payoong, N., Kwan, R.S.K., Proll, L.: Rail Container Service Planning: A Constraint-based Approach. In: Kendall, G., Petrovic, S., Burke, E., Gendreau, M. (eds.) Multidisciplinary Scheduling: Theory and Applications, pp. 343–365. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mario Giacobini Anthony Brabazon Stefano Cagnoni Gianni A. Di Caro Rolf Drechsler Anikó Ekárt Anna Isabel Esparcia-Alcázar Muddassar Farooq Andreas Fink Jon McCormack Michael O’Neill Juan Romero Franz Rothlauf Giovanni Squillero A. Şima Uyar Shengxiang Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vanitchakornpong, K., Indra-Payoong, N., Sumalee, A., Raothanachonkun, P. (2008). Constrained Local Search Method for Bus Fleet Scheduling Problem with Multi-depot with Line Change. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2008. Lecture Notes in Computer Science, vol 4974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78761-7_74

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78761-7_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78760-0

  • Online ISBN: 978-3-540-78761-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics