Abstract
In this paper we study the problem of locating a new station on an existing rail corridor and a new junction on an existing road network, and connecting them with a new road segment under a budget constraint. We consider three objective functions and the corresponding optimization problems, which are modeled by means of mixed integer non-linear programs. For small instances, the models can be solved directly by a standard solver. For large instances, an enumerative algorithm based on a discretization of the problem is proposed. Computational experiments show that the latter approach yields high quality solutions within short computing times.
Original language | English |
---|---|
Pages (from-to) | 1-16 |
Number of pages | 16 |
Journal | Transportation Research Part B: Methodological |
Volume | 68 |
DOIs | |
Publication status | Published - Oct 2014 |
Funding
This research was done while one of the co-authors (Federico Perea) was enjoying a research stay funded by the Spanish Ministerio de Educación y Ciencia , under program José Castillejo . This research was partially funded by the Canadian Natural Sciences and Engineering Research Council under grant 39682-10 , by the Spanish Ministerio de Educación, Ciencia e Innovación/FEDER under grant MTM2009-14243 , by the Spanish Ministerio de Economía y Competitividad/FEDER under grant MTM2012-37048 , and by the Junta de Andalucía/FEDER under grants P09-TEP-5022 and FQM-5849 . This support is gratefully acknowledged. Special thanks are due to the referees for their valuable comments and to Javier Fernández and Lorenzo Jaro, from the Spanish railway infrastructure management company ADIF , for providing some of the necessary data for the case study.
Keywords
- Infrastructure planning
- Non-linear programming
- Road-rail network design
- Station location
ASJC Scopus subject areas
- Civil and Structural Engineering
- Transportation