Location of infrastructure in urban railway networks

Marı́n, Ángel; García-Ródenas, Ricardo

doi:10.1016/j.cor.2008.02.008

Cited by 63 publications

(45 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, in order to compare the performance of the formulation presented here with previous formulations (i.e., the mathematical model in Marin andGarcia 2007 andMarin 2007), we define the Improved RTNDM (IRTNDM) as the mathematical model given by (l)- (2), (31), (4)- (16), (24)- (30) and (20). In addition, the term v m (X/ez.…”

Section: Zioc = ^mentioning

confidence: 99%

“…The mathematical model presented above and the classic rapid transit network design model (see Garcia et al 2006;Marin and Garcia 2007;Marin 2007) have a weak linear programming (LP) relaxation. Consequently the Branch & Bound algorithm performance is poor.…”

Section: Linearising and Strengthening The Formulationmentioning

confidence: 99%

“…Variations in these parameters will lead to different network designs. We solve the Rapid Transit Network Design Model (RTNDM) [i.e., the mathematical model in Marin and Garcia (2007) and Marin (2007)] varying the congestion factor and maximum allowable budget in order to compare the obtained solutions with the ones obtained using the IRTNDM formulation. The aim of this sensitivity analysis is twofold: first, to evaluate our approach and second, to verify the robustness of the model formulation.…”

Section: Evaluation and Performance Of The Formulationmentioning

confidence: 99%

See 2 more Smart Citations

Improved rapid transit network design model: considering transfer effects

Cadarso

Marı́n

2015

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

The rail rapid transit network design problem aims at locating train alignments and stations, maximizing demand coverage while competing with the current existing networks. We present a model formulation for computing tight bounds of the linear relaxation of the problem where transfers are also introduced. The number of transfers within a trip is a decisive attribute for attracting passengers: transferring is annoying and undesirable for passengers. We conduct computational experiments on different networks and show how we are able to solve more efficiently problems that have been already solved; sensitivity analysis on several model parameters are also performed so as to demonstrate the robustness of the new formulation.

show abstract

Section: Zioc = ^mentioning

confidence: 99%

Section: Linearising and Strengthening The Formulationmentioning

confidence: 99%

Section: Evaluation and Performance Of The Formulationmentioning

confidence: 99%

See 1 more Smart Citation

Improved rapid transit network design model: considering transfer effects

Cadarso

Marı́n

2015

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

show abstract

“…[7] and Laporte et al [8], who design a set of railway lines to optimize a certain utility function, and deal with the robustness of the resulting network. Marín and García-Ródenas [9] go one step further and consider a model with a Logit function for the trip coverage, instead of the previous all-or-nothing models. Since capacity constraints were not considered in these papers, the resulting lines could not be completely defined because frequencies could not be determined.…”

Section: Introductionmentioning

confidence: 99%

GRASP algorithms for the robust railway network design problem

et al. 2011

View full text Add to dashboard Cite

This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems.

show abstract

“…The design of the network infrastructure should address all levels simultaneously. However, the current methods usually consider the design of each level individually, such as the solutions proposed for traffic networks [13] [14] , urban railway networks [15] , water networks [16] , power distribution [17] [18] , and telecommunication networks [19] .…”

Section: Introductionmentioning

confidence: 99%

A multilevel algorithm for the network design problem

Silva

Britto

Oliveira

et al. 2011

IECON 2011 - 37th Annual Conference of the IEEE Industrial Electronics Society

View full text Add to dashboard Cite

Abstract-This paper presents a level-based algorithm to deal with the network design problem. The proposed algorithm performs the design of the different network levels simultaneously, in the sense that the information from an ascending level can be used to optimize the solution obtained for a previous level. The experimental results have shown a significant cost reduction of 13.16% when the proposed algorithm is compared to a conventional approach in which the network levels are processed in separate. In addition, the time consumed for an engineer to design the network used in the experiment was reduced.

show abstract

Location of infrastructure in urban railway networks

Cited by 63 publications

References 12 publications

Improved rapid transit network design model: considering transfer effects

Improved rapid transit network design model: considering transfer effects

GRASP algorithms for the robust railway network design problem

A multilevel algorithm for the network design problem

Contact Info

Product

Resources

About