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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Assad, M. Ball, L. Bodin, and B. Golden. Routing and Scheduling of vehicles and crews. Computer & Operations Research, 10:63–211, 1983.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: Theory, algorithms and applications. Prentice Hall, Inc., Ebglewood Cliffs, New Jersey, USA, 1993.
L. Bodin and B. Golden. Classification in vehicle routing and scheduling. Networks, 11:97–108, 1981.
P. Carraresi and G. Gallo. Network models for vehicle and crew scheduling. European Journal of Operational Research, 16:139–151, 1984.
J. Desrosiers, Y. Dumas, M. M. Solomon, and F. Soumis. Time constrained routing and scheduling. In M. Ball, T. Magnanti, C. L. Monma, and G. L. Newhauser, editors, Handbook on operations research and management sciences, chapter 2, pages 35–39. Elsevier Science B.V., North Holland, Amsterdam, The Netherlands, 1995.
M. Dell’Amico, M. Fischetti, and P. Toth. Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Science, 39(1):115–125, 1993.
J. R. Daduna and J. M. P. Paixão. Vehicle scheduling for public mass transit an overview. In J. R. Daduna, I. Branco, and J. M. P. Paixão, editors, Computer-aided transit scheduling: Lecture notes in economics and mathematical systems. Springer Verlag, 1995.
A. Löbel. Optimal vehicle scheduling in public transit. PhD thesis, Technischen Universität Berlin, Germany, 1997.
A. Löbel. Solving large-scale multiple-depot vehicle scheduling problems. In N. H. M. Wilson, editor, Computer-aided transit scheduling, pages 193–200. Springer Verlag, Germany, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Surapholchai, C., Reinelt, G., Bock, H.G. (2008). Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm. In: Bock, H.G., Kostina, E., Phu, H.X., Rannacher, R. (eds) Modeling, Simulation and Optimization of Complex Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79409-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-79409-7_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79408-0
Online ISBN: 978-3-540-79409-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)