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

• 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.

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.