HYBRID ROUTE GENERATION HEURISTIC ALGORITHM FOR THE DESIGN OF TRANSIT NETWORKS
planning - methods, planning - route design, ridership - commuting, mode - mass transit
Transit, Texas, Routes, Route analysis, Public transit, Mass transit, Local transit, Hybrid simulation, Heuristic methods, Algorithms
This paper presents a Lisp-implemented route generation algorithm (RGA) for the design of transit networks. Along with an analysis procedure and an improvement algorithm, this algorithm constitutes one of the three major components of an AI-based hybrid solution approach to solving the transit network design problem. Such a hybrid approach incorporates the knowledge and expertise of transit network planners and implements efficient search techniques using AI tools, algorithmic procedures developed by others, and modules for tools implemented in conventional languages. RGA is a design algorithm that (a) is heavily guided by the demand matrix, (b) generates different sets of routes corresponding to different trade-offs among conflicting objectives (user and operator costs). The authors explain in detail the major components of RGA, illustrate it on data generated for the transit network of the city of Austin, TX, and report on the numerical experiments conducted to test the performance of RGA.
Baaj, M, Mahmassani, H, (1995). HYBRID ROUTE GENERATION HEURISTIC ALGORITHM FOR THE DESIGN OF TRANSIT NETWORKS. Transportation Research Part C: Emerging Technologies, Volume 3, Issue 1, p. 31-50.
Transportation Research Part C Home Page: http://www.sciencedirect.com/science/journal/0968090X