摘要
基于车站的当前状态，以满足限定编组去向数为目标，对直线方向列车编组计划问题进行分析，建立了一寻找有利编组去向的数学模型．并根据模型自身的特点，设计出一复杂度为Ｏ（ｎ５）的多项式算法，同时剖析了该算法的若干特性。
In this paper,by considering the current state of the certain marshalling station, the Train Formation Plan on straight line is analysed and a mathmatical model to look for beneficial directions by regarding limited number of Formation direction as objective is given. According to characteristics of the model, we give a polynomial algorithm of complexity O(n 5) , and dissect several qualities about algorithm, and take a computation as example.
出处
《北方交通大学学报》
CSCD
北大核心
1996年第6期641-644,共4页
Journal of Northern Jiaotong University
关键词
有利去向模型
列车编组计划
铁路运输
组织管理
programing, beneficial direction, merging formation plan, tracing sign method
