Solving the Transit Network Design Problem with Constraint Programming

This paper describes how transit network design (TND) is a complex combinatorial optimization problem. The goal is to obtain an optimized public transport network, taking into consideration the main characteristics of the system, passenger’s desires, budget constraints and several possible levels of service. The author proposes a comprehensive novel model, based on Constraint Satisfaction, with essential and complementary constraints. Using Constraint Programming (CP), some tests are made using the proposed model in an attempt to open new perspectives for solution alternatives. The tests show that the chosen CP package is apparently unable to process large instances, although it works well with small ones. Other CP packages and search strategies should be tried by CP specialists in order to comprehensively validate the conclusions of the present work.

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

[2]  Randy B Machemehl,et al.  Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem , 2006 .

[3]  Partha Chakroborty,et al.  Genetic Algorithms for Optimal Urban Transit Network Design , 2003 .

[4]  Slim Abdennadher,et al.  Integration and Optimization of Rule-Based Constraint Solvers , 2003, LOPSTR.

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

[6]  B R Marwah,et al.  OPTIMAL DESIGN OF BUS ROUTES AND FREQUENCIES FOR AHMEDABAD , 1984 .

[7]  Christoph E. Mandl,et al.  Applied Network Optimization , 1980 .

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

[9]  Carlos Felipe Grangeiro Loureiro,et al.  Modeling investment options for multimodal transportation networks. , 1997 .

[10]  Hani S. Mahmassani,et al.  AN AI-BASED APPROACH FOR TRANSIT ROUTE SYSTEM PLANNING AND DESIGN , 1991 .

[11]  Antonio Mauttone,et al.  A multi-objective metaheuristic approach for the Transit Network Design Problem , 2009, Public Transp..

[12]  Hong K. Lo,et al.  A Mixed Integer Formulation for Multiple-Route Transit Network Design , 2003, J. Math. Model. Algorithms.

[13]  Hong Kam Lo,et al.  Congested multimodal transit network design , 2009, Public Transp..

[14]  Van-Dat Cung,et al.  A linear model for the transit network design problem , 2005 .

[15]  Fang Zhao,et al.  OPTIMIZATION OF TRANSIT NETWORK TO MINIMIZE TRANSFERS , 2003 .

[16]  M-C Shih,et al.  A DESIGN METHODOLOGY FOR BUS TRANSIT NETWORKS WITH COORDINATED OPERATIONS , 1994 .

[17]  P. Chakroborty,et al.  Optimal Route Network Design for Transit Systems Using Genetic Algorithms , 2002 .

[18]  Paulo Oswaldo Boaventura Netto,et al.  Uma heurística interativa para geração de caminhos em grafos com restrição de grau: aplicação ao projeto de sistemas metroviários , 2002 .

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

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

[21]  Peter J. Stuckey,et al.  Programming with Constraints: An Introduction , 1998 .