.png){kind=icon}
返回
Solution of the Train Platforming Problem
.png){kind=icon}
OA
AI
DOI：10.1287/trsc.1100.0366.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a case study from Rete Ferroviaria Italiana, the Italian Infrastructure Manager. In particular, motivated by our case study, we consider a general quadratic objective function, and propose a new way to linearize it by using a small number of new variables along with a set of constraints that can be separated efficiently by solving an appropriate linear program. The resulting integer linear programming formulation has a continuous relaxation that leads to strong bounds on the optimal value. For the instances in our case study, the solution approach based on this relaxation produces solutions that are much better than those produced by a simple heuristic method currently in use, and that often turn out to be (nearly) optimal.
Keyword:
train platforming
0.1 quadratic programming
linearization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.9K
被引数:
8.4K
机构
引用论文
分享收藏RADIUM TOXICITY PROGRAM A PROGRESS REPORT OF CLINICAL STUDIES ON TWENTY- FOUR PATIENTS镭毒性研究项目：对24名患者临床研究的进展报告.png)
OAAI
IF0
OAAI分享收藏分享收藏分享收藏 没有更多内容
没有更多内容