An Agent-Based Model for Dispatching Real-Time Demand-Responsive Feeder Bus

This research proposed a feeder bus dispatching tool that reduces rides’ effort to reach a feeder bus. The dispatching tool takes in real-time user specific request information and optimizes total cost accordingly (passenger access time cost and transit operation cost) by choosing the best pick-up locations and feeder buses’ routes. The pick-up locations are then transmitted back to passengers along with GPS guidance. The tool fits well with the Advanced Traveler Information Services (ATIS) which is one of the six high-priority dynamic mobility application bundles currently being promoted by the United State Department of Transportation. The problem is formulated into a Mixed Integer Programming (MIP) model. For small networks, out-of-the-shelf commercial solvers could be used for finding the optimal solution. For large networks, this research developed a GA-based metaheuristic solver which generates reasonably good solutions in a much shorter time. The proposed tool is evaluated on a real-world network in the vicinity of Jiandingpo metro station in Chongqing, China. The results demonstrated that the proposed ATIS tool reduces both buses operation cost and passenger walking distance. It is also able to significantly bring down computation time from more than 1 hour to about 1 min without sacrificing too much on solution optimality.

[1]  James A. Jr. Dunn Coordination of urban transit services: The german model , 1980 .

[2]  S. Mavoa,et al.  GIS based destination accessibility via public transit and walking in Auckland, New Zealand , 2012 .

[3]  Gordon F. Newell,et al.  Optimal Parameters for a Coordinated Rail and Bus Transit System , 1977 .

[4]  Ali Gholami,et al.  Economic conditions for minibus usage in a multimodal feeder network , 2011 .

[5]  G. Kuah,et al.  The Feeder-bus Network-design Problem , 1989 .

[6]  Arvid Strand,et al.  Bergen light rail – Effects on travel behaviour , 2017 .

[7]  Margaret O'Mahony,et al.  Use of a Hybrid Algorithm for Modeling Coordinated Feeder Bus Route Network at Suburban Railway Station , 2009 .

[8]  Anu Pradhan,et al.  Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms , 2013, J. Comput. Civ. Eng..

[9]  S. C. Wirasinghe,et al.  Spacing of Bus-Stops for Many to Many Travel Demand , 1981 .

[10]  Ernesto Cipriani,et al.  Transit network design: A procedure and an application to a large urban area , 2012 .

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

[12]  Margaret O'Mahony,et al.  Design of Feeder Route Network Using Combined Genetic Algorithm and Specialized Repair Heuristic , 2007 .

[13]  Margarida Vaz Pato,et al.  Search strategies for the feeder bus network design problem , 1998, Eur. J. Oper. Res..

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

[15]  Bernard F. Byrne,et al.  Cost minimizing positions, lengths and headways for parallel public transit lines having different speeds , 1976 .

[16]  Vukan R Vuchic,et al.  PUBLIC TRANSPORTATION LINE POSITIONS AND HEADWAYS FOR MINIMUM COST , 1972 .

[17]  Rahul Goel,et al.  An integrated approach for optimal rail transit corridor identification and scheduling using geographical information system , 2011 .

[18]  Luis Miguel Martínez,et al.  An Optimization Procedure to Design a Minibus Feeder Service: An Application to the Sintra Rail Line , 2012 .

[19]  Randy B Machemehl,et al.  Optimal Transit Route Network Design Problem with Variable Transit Demand: Genetic Algorithm Approach , 2006 .

[20]  Fang Zhao,et al.  Simulated Annealing-Genetic Algorithm for Transit Network Optimization , 2006 .

[21]  H. L. Ong,et al.  Applying Metaheuristics to Feeder Bus Network Design Problem , 2004, Asia Pac. J. Oper. Res..

[22]  Ricardo Giesen,et al.  How much can holding and/or limiting boarding improve transit performance? , 2012 .

[23]  Mohamed Rehan Karim,et al.  Optimization of a Transit Services Model with a Feeder Bus and Rail System Using Metaheuristic Algorithms , 2015, J. Comput. Civ. Eng..

[24]  Anthony D. May Integrated transport strategies: a new approach to urban transport policy formulation in the U.K. , 1991 .

[25]  Donald L. Miller A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems , 1995, INFORMS J. Comput..

[26]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[27]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

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

[29]  Lianbo Deng,et al.  Optimal Design of the Feeder-Bus Network Based on the Transfer System , 2013 .

[30]  James A. DunnJr. COORDINATION OF URBAN TRANSIT SERVICES: THE GERMAN MODEL , 1980 .

[31]  Steven I-Jy Chien,et al.  OPTIMAL FEEDER BUS ROUTES ON IRREGULAR STREET NETWORKS , 2000 .

[32]  Vukan R Vuchic,et al.  THE DESIGN OF BUS-RAIL TRANSIT FACILITIES , 1979 .

[33]  V. Hurdle Minimum Cost Locations for Parallel Public Transit Lines , 1973 .

[34]  Lin He,et al.  Challenges and Innovative Solutions in Urban Rail Transit Network Operations and Management: China’s Guangzhou Metro Experience , 2016 .

[35]  Xianfeng Yang,et al.  Designing a Flexible Feeder Transit System Serving Irregularly Shaped and Gated Communities: Determining Service Area and Feeder Route Planning , 2015 .

[36]  Steven I-Jy Chien,et al.  Intermodal Transit System Coordination , 2002 .

[37]  Ali Gholami,et al.  Multimodal Feeder Network Design Problem: Ant Colony Optimization Approach , 2010 .

[38]  H. L. Ong,et al.  Solving the feeder bus network design problem by genetic algorithms and ant colony optimization , 2006, Adv. Eng. Softw..