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.
Adding a new station and a road link to a road–rail network in the presence of modal competition
Transportation Research Part B: Methodological ; 68 ; 1-16
2014-05-07
16 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Adding a new station and a road link to a road–rail network in the presence of modal competition
Online Contents | 2014
|Engineering Index Backfile | 1939
|Road and rail competition in Germany
Engineering Index Backfile | 1928
Road and rail competition in South Africa
Engineering Index Backfile | 1930
|Road-rail competition for freight traffic in Kenya
TIBKAT | 1986
|