New Applications of ITS to Real-time Transit Operations

[1]  Mark E.T. Horn,et al.  Procedures for planning multi-leg journeys with fixed-route and demand-responsive passenger transport services , 2004 .

[2]  Avishai Ceder,et al.  Optimal combinations of selected tactics for public-transport transfer synchronization , 2014 .

[3]  Roberto Montemanni,et al.  An exact algorithm for the robust shortest path problem with interval data , 2004, Comput. Oper. Res..

[4]  David Bernstein,et al.  The Holding Problem with Real - Time Information Available , 2001, Transp. Sci..

[5]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[6]  Mark D. Hickman,et al.  The Real–Time Stop–Skipping Problem , 2005, J. Intell. Transp. Syst..

[7]  J. Y. Yen.  An algorithm for finding shortest routes from all source nodes to a given destination in general networks , 1970 .

[8]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[9]  Gang Yu,et al.  On the robust shortest path problem , 1998 .

[10]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[11]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[12]  Mark D. Hickman,et al.  An Analytic Stochastic Model for the Transit Vehicle Holding Problem , 2001, Transp. Sci..

[13]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[14]  Sebastien Blandin,et al.  A Tractable Class of Algorithms for Reliable Routing in Stochastic Networks , 2011 .

[15]  Jonathan Levine,et al.  Impacts of an Advanced Public Transportation System Demonstration Project , 2000 .

[16]  Lorenzo Meschini,et al.  Schedule-based transit assignment: new dynamic equilibrium model with vehicle capacity constraints , 2009 .

[17]  G. Gentile,et al.  The Theory of Transit Assignment: Demand and Supply Phenomena , 2016 .

[18]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..

[19]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[20]  Avishai Ceder,et al.  Multiagent Approach for Public Transit System Based on Flexible Routes , 2008 .

[21]  Omar J. Ibarra-Rojas,et al.  Planning, operation, and control of bus transport systems: A literature review , 2015 .

[22]  H. Van Dyke Parunak,et al.  "Go to the ant": Engineering principles from natural multi-agent systems , 1997, Ann. Oper. Res..

[23]  Tao Liu,et al.  Analysis of a new public-transport-service concept: Customized bus in China , 2015 .

[24]  Satish T. S. Bukkapatnam,et al.  Distributed architecture for real-time coordination of bus holding in transit networks , 2003, IEEE Trans. Intell. Transp. Syst..

[25]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[26]  H. Raiffa.  The Art & Science of Negotiation , 1983 .

[27]  Ismail Chabini,et al.  Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .

[28]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[29]  Randolph W. Hall,et al.  Bus dispatching at timed transfer transit stations using bus tracking technology , 1999 .

[30]  Soondal Park,et al.  Shortest paths in a network with time-dependent flow speeds , 1998, Eur. J. Oper. Res..

[31]  Giorgio Gallo,et al.  Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..

[32]  Tao Liu,et al.  Synchronizing Public Transport Transfers by Using Intervehicle Communication Scheme , 2014 .

[33]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[34]  Jean-Pierre Hubaux,et al.  A Survey of Research in Inter-Vehicle Communications , 2006 .

[35]  Tao Liu,et al.  CBVC-B: A System for Synchronizing Public-transport Transfers Using Vehicle-to-Vehicle Communication , 2014 .

[36]  Maria Kihl,et al.  Inter-vehicle communication systems: a survey , 2008, IEEE Communications Surveys & Tutorials.

[37]  Pierre Hansen,et al.  Commuters' Paths with Penalties for Early or Late Arrival Time , 1990, Transp. Sci..

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

[39]  Steve Callas,et al.  DETERMINANTS OF BUS DWELL TIME , 2004 .

[40]  Avishai Ceder,et al.  Transfer Synchronization of Public Transport Networks , 2013 .

[41]  K. Nachtigall.  Time depending shortest-path problems with applications to railway networks , 1995 .

[42]  Hannes Hartenstein,et al.  A tutorial survey on vehicular ad hoc networks , 2008, IEEE Communications Magazine.

[43]  Klaus Nökel,et al.  Boarding and Alighting in Frequency-Based Transit Assignment , 2009 .

[44]  Sang Nguyen,et al.  Route Choice on Transit Networks with Online Information at Stops , 2005, Transp. Sci..

[45]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[46]  Brian Pessaro.  Evaluation of Automated Vehicle Technology for Transit , 2006 .

[47]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[48]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[49]  Stefano Pallottino,et al.  Equilibrium traffic assignment for large scale transit networks , 1988 .

[50]  Ioannis Kaparias,et al.  Dynamic User Equilibrium in Public Transport Networks with Passenger Congestion and Hyperpaths , 2013 .

[51]  Marvin Minsky,et al.  Society of Mind: A Response to Four Reviews , 1991, Artif. Intell..

[52]  Tao Liu,et al.  Optimal Synchronized Transfers in Schedule-Based Public Transport Networks Using Online Operational Tactics , 2015 .

[53]  Avishai Ceder,et al.  Public Transit Simulation Model for Optimal Synchronized Transfers , 2008 .