| 直线方向列车编组计划有利去向模型及其多项式算法 |
| |
| 引用本文： | 查伟雄,黄孝章,秦作睿. 直线方向列车编组计划有利去向模型及其多项式算法[J]. 北京交通大学学报(自然科学版), 1996, 0(6) |
| |
| 作者姓名： | 查伟雄 黄孝章 秦作睿 |
| |
| 作者单位： | 北方交通大学运输系统模拟研究中心 |
| |
| 摘 要： | 基于车站的当前状态，以满足限定编组去向数为目标，对直线方向列车编组计划问题进行分析，建立了一寻找有利编组去向的数学模型．并根据模型自身的特点，设计出一复杂度为Ｏ（ｎ５）的多项式算法，同时剖析了该算法的若干特性，并举例演示计算
|
| 关 键 词： | 0－1规划，有利去向，合并式编组方案，追踪标记 |
The Beneficial Directions Model and a Polynomial Algorithm for the Train Formation Plan on Straight Line |
| |
| Zha Weixiong Huang Xiaozhang Qin Zuorui. The Beneficial Directions Model and a Polynomial Algorithm for the Train Formation Plan on Straight Line[J]. JOURNAL OF BEIJING JIAOTONG UNIVERSITY, 1996, 0(6) |
| |
| Authors: | Zha Weixiong Huang Xiaozhang Qin Zuorui |
| |
| Abstract: | 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. |
| |
| Keywords: | programing beneficial direction merging formation plan tracing sign method |
| 本文献已被 CNKI 等数据库收录！ |
