Design of Feeder Route Network Using Combined Genetic Algorithm and Specialized Repair Heuristic

In metropolitan cities an efficient integrated public transportation system is unavoidable to restrict unsustainable growth of private and intermediate transport modes. Well-designed feeder routes and coordinated schedules to minimize transfer time from the main transit to feeder buses play an important role. Past literature reveals that a heuristic approach had been popular for design of routes and had been applied successfully in a variety of network design problems. Nontraditional optimization techniques, especially genetic algorithms, are also found to be very effective in the generation of optimized feeder routes and schedules. In this research the genetic algorithm first develops feeder routes and then a specialized heuristic algorithm works as a repair algorithm to satisfy the demand of all the nodes. Thus, the advantages of both genetic algorithms and specialized heuristic algorithms are obtained in this method. The developed feeder route structure is found to be better in terms of load factors in buses, satisfaction of demand, and waiting time for feeder buses as compared to existing scenarios and earlier approaches adopted for the same study area.

[1]  Randy B Machemehl,et al.  OPTIMAL TRANSIT ROUTE NETWORK DESIGN PROBLEM: ALGORITHMS, IMPLEMENTATIONS, AND NUMERICAL RESULTS , 2004 .

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

[3]  S. L. Dhingra,et al.  DEVELOPMENT OF FEEDER ROUTES FOR SUBURBAN RAILWAY STATIONS USING HEURISTIC APPROACH , 2001 .

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Margaret O'Mahony,et al.  A Model for Development of Optimized Feeder Routes and Coordinated Schedules—A Genetic Algorithms Approach , 2006 .

[6]  Kalyanmoy Deb,et al.  Optimization for Engineering Design: Algorithms and Examples , 2004 .

[7]  Prabhat Shrivastava,et al.  Model for simultaneous routing and scheduling using genetic alghoritm , 2000 .

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

[9]  D. F. Dubois,et al.  A Set of Methods in Transportation Network Synthesis and Analysis , 1979 .

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

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

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

[13]  Lazar N Spasovic,et al.  Optimization of Bus Route Planning in Urban Commuter Networks , 2003 .

[14]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

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

[16]  Fang Zhao,et al.  Transit Network Optimization - Minimizing Transfers and Optimizing Route Directness , 2004 .

[17]  S. L. Dhingra,et al.  Development of Coordinated Schedules using Genetic Algorithms , 2002 .

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

[19]  Margaret O'Mahony,et al.  Modeling an Integrated Public Transportation System - a case study in Dublin, Ireland , 2009 .