4.7 Article

On solving multi-type railway line planning problems

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 168, 期 2, 页码 403-424

出版社

ELSEVIER
DOI: 10.1016/j.ejor.2004.04.036

关键词

integer programming; combinatorial optimisation; railway transportation

向作者/读者索取更多资源

An important strategic element in the planning process of a railway operator is the development of a line plan, i.e., a set of routes (paths) on the network of tracks, operated at a given hourly frequency. The models described in the literature have thus far considered only lines that halt at all stations along their route. In this paper we introduce several models for solving line planning problems in which lines can have different halting patterns. Correctness and equivalence proofs for these models are given, as well as an evaluation using several real-life instances. (c) 2004 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据