论文部分内容阅读
本文对路网上技术站多种能力约束下的单组列车编组问题建立了整体性数学模型,并提出了一种启发式算法和一种分枝定界算法。由于此问题的提法与实际问题基本吻合,所以它可用于制定全路网的列车编组计划。
In this paper, a holistic mathematical model is established for the single-group train marshalling problem under the constraint of various abilities of road network technology stations. A heuristic algorithm and a branch-and-bound algorithm are proposed. Since the formulation of this question is basically in line with the actual problem, it can be used to formulate a train plan of the entire network.