Optimal number and scheduling of freeway bus fleet

Abstract Optimizing the number of freeway buses and preparing a quality schedule fundamentally influences the performance of a transportation company. The cost of over-covering or uncovering duty and of buses waiting for dispatch in a station is important practical issues that remain unsolved. A feasible solution should simultaneously consider the number of buses required to ensure high service capacity, and effective bus scheduling. Freeway bus scheduling is a short-term issue that is subject to time pressure. In particular, immediate rescheduling is generally needed when traffic jams or accidents occur. Finding solutions that obtain both the optimal number of buses and the optimal schedule is a complicated NP-hard problem. This study uses genetic algorithm that simultaneously considers the number of freeway buses and the schedule. The proposed model obtains an approximately optimal solution in a short time. The proposed model is tested by the bus timetable of a current transportation company, revealing that the scheduling problems can be solved quickly and correctly, improving the firm’s performance by 22.12%.

[1]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[2]  Walter Ukovich,et al.  A comparison of different solution approaches to the vehicle scheduling problem in a practical case , 2000, Comput. Oper. Res..

[3]  Sam Kwong,et al.  Genetic algorithm to production planning and scheduling problems for manufacturing systems , 2000 .

[4]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  Jorge Pinho de Sousa,et al.  Genetic algorithms for the bus driver scheduling problem: a case study , 2002, J. Oper. Res. Soc..

[7]  P. Kreuzer,et al.  Optimal lines for railway systems , 1997 .

[8]  David W. Corne,et al.  Evolutionary Divide and Conquer for the Set-Covering Problem , 1996, Evolutionary Computing, AISB Workshop.

[9]  Eiichi Taniguchi,et al.  INTELLIGENT TRANSPORTATION SYSTEM BASED DYNAMIC VEHICLE ROUTING AND SCHEDULING WITH VARIABLE TRAVEL TIMES , 2004 .

[10]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[11]  Maurizio Bielli,et al.  Genetic algorithms in bus network optimization , 2002 .

[12]  ANTHONY WREN,et al.  A genetic algorithm for public transport driver scheduling , 1995, Comput. Oper. Res..

[13]  Raymond S. K. Kwan,et al.  A fuzzy genetic algorithm for driver scheduling , 2003, Eur. J. Oper. Res..

[14]  Godfrey C. Onwubolu,et al.  Genetic algorithm for minimizing tardiness in flow-shop scheduling , 1999 .

[15]  Guy Desaulniers,et al.  Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..

[16]  Sooyoung Kim,et al.  Application of genetic algorithms for scheduling batch-discrete production system , 2002 .

[17]  N. Jawahar,et al.  A multiobjective genetic algorithm for job shop scheduling , 2001 .

[18]  Vinicius Amaral Armentano,et al.  A genetic algorithm for scheduling on a single machine with set-up times and due dates , 2000 .

[19]  Chung-Wei Feng,et al.  Optimizing the schedule of dispatching RMC trucks through genetic algorithms , 2004 .