Highlights We analyze the problem of locating one station in a railway corridor. The new station is linked with a road network by means of a road link. Building the new station and the new road link generate costs. Several objectives are considered under budget constraints. A MINLP based algorithm and a heuristic are proposed and tested.

    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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Adding a new station and a road link to a road–rail network in the presence of modal competition


    Contributors:


    Publication date :

    2014-05-07


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Rail and road competition

    Hawkes, F.R. | Engineering Index Backfile | 1939


    Road and rail competition in Germany

    Engineering Index Backfile | 1928


    Road and rail competition in South Africa

    Hart, V. | Engineering Index Backfile | 1930