期刊
JOURNAL OF HEURISTICS
卷 19, 期 2, 页码 399-422出版社
SPRINGER
DOI: 10.1007/s10732-011-9185-z
关键词
Transportation; Robustness; Heuristics
资金
- Spanish Ministerio de Fomento [PT-2007-003]
- Ministerio de Ciencia y Educacion [MTM2009-14243]
- Junta de Andalucia [P09-TEP-5022]
- FEDER funds of the European Union
- TUSSAM (Seville, Spain)
This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据