Constrained local search method for bus fleet scheduling problem with multi-depot with line change

Authors:
Kriangsak Vanitchakornpong;Nakorn Indra-Payoong;Agachai Sumalee;Pairoj Raothanachonkun
Affiliations:
College of Transport and Logistics, Burapha University, Chonburi, Thailand;College of Transport and Logistics, Burapha University, Chonburi, Thailand;Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong;College of Transport and Logistics, Burapha University, Chonburi, Thailand
Venue:
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Year:
2008

Citing 2
Cited 0

Vehicle scheduling in public transit and Lagrangean pricing

Management Science
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.