RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication
Artículo científico (JournalArticle)
The Railway Line Frequency and Size Setting Problem
[EN] The problem studied in this paper takes as input data a set of lines
forming a railway network, and an origin¿destination (OD) matrix. The OD pairs
may use either the railway network or an alternative transportation mode. The
objective is to determine the frequency/headway of each line as well as its number
of carriages, so that the net profit of the railway network is maximized. We propose
a mixed integer non-linear programming formulation for this problem. Because of
the computational intractability of this model, we develop four algorithms: a mixed
integer linear programming (MIP) model, a MIP-based iterative algorithm, a
shortest-path based algorithm, and a local search. These four algorithms are tested
and compared over a set of randomly generated instances. An application over a
case study shows that only the local search heuristic is capable of dealing with large
instances., This research was partly funded by the Canadian Natural Sciences and Engineering Research Council under Grant 2015-06189, by the Ministerio de Economía y Competitividad (Spain)/FEDER under projects MTM2012-37048, MTM2015-67706-P and DPI2012-36243-C02-01, and by Junta de Andalucía (Spain)/FEDER under excellence project P10-FQM-5849. Part of this research was done while Federico Perea was enjoying a research visit to CIRRELT, funded by the Universitat Politècnica de València, under program PAID-00-15. This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.
Project:
Universitat Politècnica de València PAID-00-15
,
Natural Sciences and Engineering Research Council of Canada 2015-06189
,
Ministerio de Economía y Competitividad MTM2012-37048
,
Ministerio de Economía y Competitividad MTM2015-67706-P
,
Junta de Andalucía P10-FQM-5849
,
Ministerio de Economía y Competitividad DPI2012-36243-C02-01