A clonal selection algorithm for urban bus vehicle scheduling |
| |
| Affiliation: | 1. School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China;2. Industrial and System Engineering Department, Auburn University, AL, USA;1. Université de Tunis, SMART Lab, 2000, Bardo, Tunisia;2. Ecole Centrale Casablanca, Bouskoura Ville Verte, 27182, Casablanca, Morocco;1. Department of Applied Mathematics and Computational Sciences, University of Cantabria, Avda. de los Castros s/n, 39005 Santander, Spain;2. Department of Information Science, Faculty of Sciences, Toho University, 2-2-1 Miyama, 274-8510 Funabashi, Japan;3. Department of Geographical Engineering and Graphical Expression Techniques, University of Cantabria, Avda. de los Castros s/n, 39005 Santander, Spain;1. College of Marine Engineering, Northwestern Polytechnical University, Xi’an 710072, PR China;2. National Key Laboratory of Underwater Information Process and Control, Xi’an 710072, PR China |
| |
| Abstract: | The bus vehicle scheduling problem addresses the task of assigning vehicles to cover the trips in a timetable. In this paper, a clonal selection algorithm based vehicle scheduling approach is proposed to quickly generate satisfactory solutions for large-scale bus scheduling problems. Firstly, a set of vehicle blocks (consecutive trips by one bus) is generated based on the maximal wait time between any two adjacent trips. Then a subset of blocks is constructed by the clonal selection algorithm to produce an initial vehicle scheduling solution. Finally, two heuristics adjust the departure times of vehicles to further improve the solution. The proposed approach is evaluated using a real-world vehicle scheduling problem from the bus company of Nanjing, China. Experimental results show that the proposed approach can generate satisfactory scheduling solutions within 1 min. |
| |
| Keywords: | Vehicle scheduling Bus scheduling Immune algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
