Optimising large scale public transport network design problems using mixed-mode parallel multi-objective evolutionary algorithms

In this paper we present a novel tool, using both OpenMP and MPI protocols, for optimising the efficiency of Urban Transportation Systems within a defined catchment, town or city. We build on a previously presented model which uses a Genetic Algorithm with novel genetic operators to optimise route sets and provide a transport network for a given problem set. This model is then implemented within a Parallel Multi-Objective Genetic Algorithm and demonstrated to be scalable to within the scope of real world, [city-wide], problems. This paper compares and contrasts three methods of parallel distribution of the Genetic Algorithm's computational workload: a job farming algorithm and two variations on an `Islands' approach. Results are presented in the paper from both single and mixed mode strategies. The results presented are from a range of previously published academic problem sets. Additionally a real world inspired problem set is evaluated and a visualisation of the optimised output is given.

[1]  Christine L. Mumford,et al.  An Improved Multi-objective Algorithm for the Urban Transit Routing Problem , 2014, EvoCOP.

[2]  Hani S. Mahmassani,et al.  Hybrid route generation heuristic algorithm for the design of transit networks , 1995 .

[3]  Randy B Machemehl,et al.  A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem , 2008 .

[4]  Christine L. Mumford,et al.  New heuristic and evolutionary operators for the multi-objective urban transit routing problem , 2013, 2013 IEEE Congress on Evolutionary Computation.

[5]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[6]  Avishai Ceder,et al.  Transit-network design methodology for actual-size road networks , 2011 .

[7]  Marc Parizeau,et al.  The Master-Slave Architecture for Evolutionary Computations Revisited , 2003, GECCO.

[8]  Edwin D. de Jong,et al.  Reducing bloat and promoting diversity using multi-objective methods , 2001 .

[9]  Albert Gan,et al.  Transit network optimization : Minimizing transfers and maximizing service coverage with an integrated simulated annealing and tabu search method , 2005 .

[10]  Adrien Goëffon,et al.  A Dynamic Island-Based Genetic Algorithms Framework , 2010, SEAL.

[11]  S. B. Pattnaik,et al.  Urban Bus Transit Route Network Design Using Genetic Algorithm , 1998 .

[12]  Tom V. Mathew,et al.  Transit route network design using parallel genetic algorithm , 2004 .

[13]  Christoph E. Mandl,et al.  Evaluation and optimization of urban public transportation networks , 1980 .

[14]  L. A. Silman,et al.  Planning the route system for urban buses , 1974, Comput. Oper. Res..

[15]  Fang Zhao,et al.  OPTIMIZATION OF TRANSIT NETWORK TO MINIMIZE TRANSFERS , 2003 .

[16]  Nigel H. M. Wilson,et al.  Bus network design , 1986 .

[17]  W. Lampkin,et al.  The Design of Routes, Service Frequencies, and Schedules for a Municipal Bus Undertaking: A Case Study , 1967 .

[18]  Juan Julián Merelo Guervós,et al.  Genotypic differences and migration policies in an island model , 2009, GECCO.

[19]  Nicholas K. Allsopp,et al.  A hybrid, massively parallel implementation of a genetic algorithm for optimization of the impact performance of a metal/polymer composite plate , 2013, Int. J. High Perform. Comput. Appl..

[20]  S. Mohan,et al.  TRANSIT ROUTE NETWORK DESIGN USING FREQUENCY CODED GENETIC ALGORITHM , 2003 .

[21]  P. Chakroborty,et al.  Optimal Route Network Design for Transit Systems Using Genetic Algorithms , 2002 .

[22]  M. Southworth,et al.  Streets and the Shaping of Towns and Cities , 1996 .

[23]  Luis Ferreira,et al.  PUBLIC TRANSPORTATION ACCESS , 1998 .

[24]  坂本 文人,et al.  Argonne National Laboratory 滞在記 , 2005 .

[25]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[26]  M-C Shih,et al.  A DESIGN METHODOLOGY FOR BUS TRANSIT NETWORKS WITH COORDINATED OPERATIONS , 1994 .

[27]  G. Currie.  Gap Analysis of Public Transport Needs:Measuring Spatial Distribution of Public Transport Needs and Identifying Gaps in the Quality of Public Transport Provision , 2004 .

[28]  Randy B Machemehl,et al.  Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem , 2006 .

[29]  D. B. Hess,et al.  Walking to the bus: perceived versus actual walking distance to bus stops for older adults , 2012 .

[30]  Christoph E. Mandl,et al.  Applied Network Optimization , 1980 .

[31]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[32]  Gary Higgs,et al.  Using floating catchment analysis (FCA) techniques to examine intra-urban variations in accessibility to public transport opportunities: the example of Cardiff, Wales , 2012 .

[33]  Enrique Alba,et al.  Analyzing synchronous and asynchronous parallel distributed genetic algorithms , 2001, Future Gener. Comput. Syst..

[34]  Michael Affenzeller,et al.  SASEGASA: A New Generic Parallel Evolutionary Algorithm for Achieving Highest Quality Results , 2004, J. Heuristics.

[35]  Evandro Parente,et al.  A hybrid shared/distributed memory parallel genetic algorithm for optimization of laminate composites , 2014 .

[36]  Zhurong Wang,et al.  A study of hybrid parallel genetic algorithm model , 2011, 2011 Seventh International Conference on Natural Computation.

[37]  Alex A. Freitas,et al.  Devising adaptive migration policies for cooperative distributed genetic algorithms , 2002, IEEE International Conference on Systems, Man and Cybernetics.