An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem

2017 ◽  
Vol 78 ◽  
pp. 1-14 ◽  
Author(s):  
David Canca ◽  
Alicia De-Los-Santos ◽  
Gilbert Laporte ◽  
Juan A. Mesa
Keyword(s):  
Network Design ◽  
Neighborhood Search ◽  
Planning Problem ◽  
Rapid Transit ◽  
Line Planning ◽  
Transit Network ◽  
Transit Network Design ◽  
Adaptive Neighborhood

scholarly journals APPLICATION OF A NEW RAPID TRANSIT NETWORK DESIGN MODEL TO BUS RAPID TRANSIT NETWORK DESIGN: CASE STUDY ISFAHAN METROPOLITAN AREA

Transport ◽  
2013 ◽  
Vol 30 (1) ◽  
pp. 92-102 ◽  
Author(s):  
Shahab Kermanshahi ◽  
Yousef Shafahi ◽  
Mehdi Bagherian
Keyword(s):  
Network Design ◽  
Search Tree ◽  
Bus Rapid Transit ◽  
Rapid Transit ◽  
Design Problems ◽  
Transit Network ◽  
Real Size ◽  
Transit Route ◽  
Transit Network Design

The problem of Rapid Transit Network Design (RTND) is studied in this paper. Due to the noticeable contribution of rapid transit lines in public transportation network of large urban areas, this problem is interesting to the transportation specialists. On the other hand, the success stories of Bus Rapid Transit (BRT) systems in different countries have motivated us to study BRT network planning. BRT systems can be developed with less investment costs and construction time in comparison with rail-based systems. Therefore, planning Bus Rapid Transit lines, either to develop a new rapid transit network or extend a current one can be an interesting research topic. This problem, like other network design problems is difficult to solve for large scale networks. In this study, a mixed-integer mathematical model that addresses the Transit Network Design Problem (TNDP) is presented. The objective function of the model is maximization of trip coverage. To solve the model, an algorithm is proposed and implemented in C# environment. The main modules of the algorithm are the following: (1) routes generation, (2) search tree, (3) solution evaluation, and (4) inference. In Route Generation module, the candidate transit route set is determined. Afterwards, the Search Tree module provides a strategy which guarantees that all feasible combinations can be considered in the search process. To evaluate the performance of each transit route combination, a transit assignment algorithm is used in the Solution Evaluation part. Finally, the intelligence core of the search process, that is called Inference, helps the algorithm to find parts of the search space which cannot contain the optimal solution. The algorithm is tested on a real size network, i.e., the extension of the Greater Isfahan rapid transit network with BRT routes. The output of the algorithm is the set of BRT routes that maximizes the daily trip coverage index while satisfying the budget constraint. By solving the case study problem, it is shown that our proposed model and algorithm are capable of tackling real size rapid transit network design problems.

scholarly journals Rapid transit network design: considering recovery robustness and risk aversion measures

2017 ◽  
Vol 22 ◽  
pp. 255-264 ◽  
Author(s):  
Luis Cadarso ◽  
Esteve Codina ◽  
Laureano F. Escudero ◽  
Angel Marín
Keyword(s):  
Risk Aversion ◽  
Network Design ◽  
Rapid Transit ◽  
Transit Network ◽  
Transit Network Design

Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile

2017 ◽  
Vol 78 ◽  
pp. 27-43 ◽  
Author(s):  
Gabriel Gutiérrez-Jarpa ◽  
Gilbert Laporte ◽  
Vladimir Marianov ◽  
Luigi Moccia
Keyword(s):  
Network Design ◽  
Rapid Transit ◽  
Transit Network ◽  
Multi Objective ◽  
Transit Network Design

Rapid transit network design for optimal cost and origin–destination demand capture

2013 ◽  
Vol 40 (12) ◽  
pp. 3000-3009 ◽  
Author(s):  
Gabriel Gutiérrez-Jarpa ◽  
Carlos Obreque ◽  
Gilbert Laporte ◽  
Vladimir Marianov
Keyword(s):  
Network Design ◽  
Rapid Transit ◽  
Optimal Cost ◽  
Transit Network ◽  
Transit Network Design
Sign in / Sign up

Export Citation Format

Share Document