| 客运专线动车组运用计划的计算机编制 |
| |
| 引用本文： | 张杰,陈韬,施福根. 客运专线动车组运用计划的计算机编制[J]. 西南交通大学学报, 2006, 41(5): 635-640 |
| |
| 作者姓名： | 张杰 陈韬 施福根 |
| |
| 作者单位： | 西南交通大学交通运输学院,四川,成都,610031 |
| |
| 基金项目： | 国家“十五”科技攻关项目（2002BA407B） |
| |
| 摘 要： | 根据动车组运用规则，建立了动车组运用计划整数规划模型．为降低求解的复杂性，将动车组运用计划编制问题转化为交路段生成和基于交路段的交路生成两个问题分步求解．用多起点搜索和交路段互换的方法，使求解结果在有效性和均衡性上得以优化．实际编制实验表明了模型和算法的有效性．
|
| 关 键 词： | 客运专线 动车组 运用计划 交路 整数规划 算法 |
| 文章编号： | 0258-2724（2006）05-0635-06 |
| 收稿时间： | 2006-04-02 |
| 修稿时间： | 2006-04-02 |
Computer Scheduling of Motor Train-sets for High Speed Passenger Railways |
| |
| ZHANG Jie,CHEN Tao,SHI Fu-gen. Computer Scheduling of Motor Train-sets for High Speed Passenger Railways[J]. Journal of Southwest Jiaotong University, 2006, 41(5): 635-640 |
| |
| Authors: | ZHANG Jie CHEN Tao SHI Fu-gen |
| |
| Affiliation: | School of Traffic and Transp. , Southwest Jiaotong University, Chengdu 610031, China |
| |
| Abstract: | An integer programming model was presented based on the rules of motor train-set operation.To reduce the complexity,the motor train-set scheduling problem was divided into two sub-problems: making sub-routings and then building routings based on the sub-routings.A multi-start search algorithm and path-exchange strategy were designed to optimize the routings in terms of effectiveness and balance.An example was presented to show the feasibility of the proposed model and algorithm. |
| |
| Keywords: | high speed passenger railway motor train-set scheduling routing integer programming algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
