Please use this identifier to cite or link to this item:
Title: Constrained local search method for bus fleet scheduling problem with multi-depot with line change
Authors: Vanitchakornpong, K
Indra-Payoong, N
Sumalee, A 
Raothanachonkun, R
Issue Date: 2008
Publisher: Springer
Source: In M Giacobini, A Brabazon, S Cagnoni, GAD Caro, R Drechsler, A Ekárt, AI Esparcia-Alcázar, M Farooq, A Fink, J McCormack, M O’Neill, J Romero, F Rothlauf, G Squillero, AŞ Uyar & S Yang (Eds.), Applications of evolutionary computing : EvoWorkshops 2008 : Evocomnet, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008 : proceedings, p. 679-688. Berlin ; New York: Springer, 2008 How to cite?
Series/Report no.: Lecture notes in computer science ; v. 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.
ISBN: 9783540787600
DOI: 10.1007/978-3-540-78761-7_74
Appears in Collections:Book Chapter

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jun 17, 2018

Page view(s)

Last Week
Last month
Citations as of Jun 17, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.