The commuter rail circulator network design problem: Formulation, solution methods, and applications

Commuter rail is increasingly popular as a means to introduce rail transportation to metropolitan transportation systems. The long-term benefits of commuter rail include the addition of capacity to the transportation system, providing a quality commute alternative, and shifting land use toward transit-oriented development patterns. The success of a commuter rail system depends upon cultivating a ridership base upon which to expand and improve the system. Cultivating this ridership is dependent upon offering a quality transportation option to commuters. Characteristics of commuter rail systems in the United States present challenges to offering quality service that must be overcome. Commuter rail has been implemented only on existing rail right-of-way (ROW) and infrastructure (depending upon condition) in the United States. Existing rail ROW does not often coincide with current commercial and residential demand centers and necessitates the use of a circulator system to expand the service boundary of commuter rail to reach these demand centers. The commuter rail circulator network design problem (CRCNDP) addresses a particular aspect of the commuter rail trip, seeking to improve the performance of the entire system through accurately modeling the portion of the trip from rail station to the final destination. This final leg includes both the trip on the circulator vehicle and the walking trip from the circulator stop to the final destination. This report seeks to provide an innovative mathematical programming formulation and solution methodology for the CRCNDP and apply this method to a case study.

[1]  M. Florian,et al.  The convergence of diagonalization algorithms for asymmetric network equilibrium problems , 1982 .

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

[3]  Vukan R Vuchic,et al.  Urban Public Transportation: Systems and Technology , 1981 .

[4]  Khalied Hyari,et al.  Optimal Planning and Scheduling for Repetitive Construction Projects , 2006 .

[5]  Dietmar Cieslik.  The Steiner Ratio , 2001 .

[6]  Patrice Marcotte,et al.  Capacitated transit assignment with loading priorities , 2004, Math. Program..

[7]  Paul M. Schonfeld,et al.  Optimization Models for Comparing Conventional and Subscription Bus Feeder Services , 1991, Transp. Sci..

[8]  Amr Kandil,et al.  MACROS: Multiobjective Automated Construction Resource Optimization System , 2006 .

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

[10]  P. Calthorpe.  The Next American Metropolis: Ecology, Community, and the American Dream , 1993 .

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

[12]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[13]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[14]  Lazar N Spasovic,et al.  Evaluation of Feeder Bus Systems with Probabilistic Time-Varying Demands and Nonadditive Time Costs , 2001 .

[15]  Gordon F. Newell,et al.  Some Issues Relating to the Optimal Design of Bus Routes , 1979 .

[16]  David M. Stein,et al.  An Asymptotic, Probabilistic Analysis of a Routing Problem , 1978, Math. Oper. Res..

[17]  Chandra R. Bhat,et al.  Austin Commuter Survey: Findings and Recommendations , 2005 .

[18]  Lori Acken.  Dallas Area Rapid Transit: Miles Ahead with Miles to Go , 2005 .

[19]  Young-Jae Lee,et al.  Transit Network Design with Variable Demand , 2005 .

[20]  G. Nemhauser,et al.  Integer Programming , 2020 .

[21]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[22]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

[23]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

[25]  Jia Hao Wu,et al.  Transit Equilibrium Assignment: A Model and Solution Algorithms , 1994, Transp. Sci..

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

[27]  Michael Florian,et al.  Optimizing frequencies in a transit network: a nonlinear bi-level programming approach , 1995 .

[28]  Avishai Ceder,et al.  Optimal Routing Design for Shuttle Bus Service , 2006 .

[29]  Peter Loukopoulos,et al.  Are car users too lazy to walk? The relationship of distance thresholds for driving to the perceived effort of walking , 2005 .

[30]  Chris Hendrickson,et al.  Design of Local Bus Service with Demand Equilibration , 1982 .

[31]  Harold Moellering,et al.  An interactive graphic transit planning system based on individuals , 1977 .

[32]  Robert B. Dial,et al.  Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms , 1996, Transp. Sci..

[33]  David Bernstein,et al.  Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models , 2000, Comput. Math. Organ. Theory.

[34]  Vukan R Vuchic,et al.  Urban Transit : Operations, Planning and Economics , 2005 .

[35]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

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

[37]  Sigurd Grava,et al.  Urban Transportation Systems. Choices for Communities , 2003 .

[38]  Linda Bailey.  Public Transportation and Petroleum Savings in the U.S.: Reducing Dependence on Oil , 2007 .

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

[40]  M. Kuby,et al.  Factors influencing light-rail station boardings in the United States , 2004 .

[41]  R. Ewing.  Pedestrian- and Transit-Friendly Design: A Primer for Smart Growth , 1999 .

[42]  Herbert S Levinson,et al.  ANALYZING TRANSIT TRAVEL TIME PERFORMANCE , 1983 .

[43]  D. Schrank,et al.  THE 2004 URBAN MOBILITY REPORT , 2002 .

[44]  Todd Litman,et al.  Impacts of Rail Transit on the Performance of a Transportation System , 2005 .

[45]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[46]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[47]  Jossef Perl,et al.  Closure of "Optimization of Feeder Bus Routes and Bus Stop Spacing" , 1988 .

[48]  P. Schonfeld,et al.  Multiple period optimization of bus transit systems , 1991 .

[49]  Jossef Perl,et al.  A METHODOLOGY FOR FEEDER-BUS NETWORK DESIGN , 1987 .

[50]  Paul Schonfeld,et al.  METHOD FOR OPTIMIZING TRANSIT SERVICE COVERAGE , 1993 .

[51]  Brian Canepa,et al.  Bursting the Bubble , 2007 .

[52]  Avishai Ceder,et al.  User and Operator Perspectives in Transit Network Design , 1998 .

[53]  Alan T. Murray.  A Coverage Model for Improving Public Transit System Accessibility and Expanding Access , 2003, Ann. Oper. Res..

[54]  ECONorthwest,et al.  Estimating the Benefits and Costs of Public Transit Projects: A Guidebook for Practitioners , 2002 .

[55]  Paul Schonfeld,et al.  JOINT OPTIMIZATION OF A RAIL TRANSIT LINE AND ITS FEEDER BUS SYSTEM , 1998 .

[56]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.