Genetic Algorithm-Based Approach for Optimal Location of Transit Repair Vehicles on a Large Urban Network

Determining the optimal location of a fleet of vehicles is necessary in a number of potential applications, such as special repair vehicles for buses on a large public transportation network. The Athens Urban Transport Authority operates a large bus fleet over an extensive network for 19 h a day and serves a population of approximately 4 million people, all in a heavily congested road network. During the 2004 Summer Olympic Games, held in Athens, most spectators, employees, and volunteers were transported to and from Olympic Games venues by public transportation. Dedicated Olympic Games bus lines operated under a tight around-the-clock schedule. During normal operations and particularly during events such as the Olympic Games, incidents such as vehicle breakdowns and minor accidents can have a severe effect on the operation of the public transport network and can cause a significant decrease in the level of service. To help the authority locate bus repair vehicles over the entire network, a decision support system was developed on the basis of an embedded genetic algorithm used for obtaining optimal location solutions. The system's design and performance make it easy to operate under real-time conditions, which is useful for planning and for fast vehicle redeployment.

[1]  N. Megiddo,et al.  The Maximum Coverage Location Problem , 1983 .

[2]  Paul Schonfeld,et al.  Preliminary Highway Design with Genetic Algorithms and Geographic Information Systems , 2000 .

[3]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[4]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[5]  C. Revelle,et al.  A Lagrangean heuristic for the maximal covering location problem , 1996 .

[6]  Cem Saydam,et al.  Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study , 2002, Eur. J. Oper. Res..

[7]  Cem Saydam,et al.  Accurate estimation of expected coverage: revisited , 2003 .

[8]  Rajan Batta,et al.  On the use of genetic algorithms to solve location problems , 2002, Comput. Oper. Res..

[9]  Brian Boffey,et al.  A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem , 2000, Eur. J. Oper. Res..

[10]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[11]  P. Schonfeld,et al.  An evolutionary model for simultaneously optimizing three-dimensional highway alignments , 2003 .

[12]  Xin Lin,et al.  Columnar to equiaxed transition during alloy solidification , 2003 .

[13]  Christopher R. Stephens,et al.  Schemata Evolution and Building Blocks , 1999, Evolutionary Computation.

[14]  Mark S. Daskin,et al.  Two New Location Covering Problems: The Partial P‐Center Problem and the Partial Set Covering Problem , 1999 .

[15]  Riccardo Poli,et al.  Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover , 2001, Genetic Programming and Evolvable Machines.