期刊文献+

铁路编组站配流与调机运用的协调决策优化 被引量:2

Coordination decision optimization for wagon-flow allocating and shunting locomotive utilization in railway marshalling station
下载PDF
导出
摘要 运用数学优化方法,研究列车配流与调机运用的协调决策问题。建立了以欠轴列车数最少为目标的协调优化模型,并采用改进遗传算法求解。根据列车解体和编组顺序的特点,利用解体序号矩阵,采用自然数编码,并针对问题的特殊性应用联赛选择规则进行选择,且进行有限制的个体变异操作,减少了遗传算法本身随机性带来的影响,使变异后的种群能向高适应度方向进化。以某编组站为例进行模拟计算,结果表明该算法能够在较短时间内收敛至满意解。 The coordination decision problem of train wagon-flow allocating and shunting locomotive utilization is described using mathematics optimization method. The coordination decision model is established taking the full load train to the largest counts as goal, and adopts improving genetic algorithm to solve. According to the characteristic of train sorting, the natural number code and splitting up serial number matrix are adopted. The ague selection rules and limited individual variation are used to decrease randomness that genetic algorithm brings, and make the population after dissociation can face high fit in direction evolution. Taking some marshalling station as an example to simulate, the result proves that this algorithm can converge to satisfactory solution within shorter time.
出处 《计算机工程与应用》 CSCD 2013年第5期32-35,63,共5页 Computer Engineering and Applications
基金 国家自然科学基金(No.61203175,No.61104175) 轨道交通控制与安全国家重点实验室(北京交通大学)开放课题基金资助(No.RCS2011K012)
关键词 编组站 配流 调机运用 协调决策 遗传算法 marshalling station wagon-flow allocating shunting locomotive coordination decision genetic algorithm
  • 相关文献

参考文献9

二级参考文献39

共引文献72

同被引文献26

  • 1王明慧,赵强.编组站智能调度系统阶段计划优化模型及算法研究[J].铁道学报,2005,27(6):1-9. 被引量:36
  • 2刘露.基于约束传播技术的资源受限项目调度问题求解算法[D].沈阳:东北大学,2011:10-30.
  • 3HOOKER J N. Logic, Optimization and Constraint Programming I-J]. Informs Journal on Computing, 2002, 14 (4) : 295-321.
  • 4刘露.基于约束传播技术的资源受限项目调度问题求解算法[D].沈阳:东北大学,2006:10-30.
  • 5OJHA A K, BISWAL K K. Lexicographic Multi-Objective Geometric Programming Problems EJ]. IJCSI Interna- tional Journal of Computer Science Issues, 2009, 6 (2): 20-24.
  • 6ROSSI F, BEEK P V, WALSH T. Handbook of Constraint Programming [M]. Pisa: Elsevier, 2006: 27-78, 206- 235, 541 580, 759-797.
  • 7BECK J C. Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling [J]. Journal of Artificial Intelligence Research, 2007, 29: 49 77.
  • 8BECK J C. Multi-Point Constructive Search [J]. Principles and Practice of Constraint Programming CP 2005, 2005, 3709:737 741.
  • 9Rossi F, van Beek P, Walsh T. Handbook of constraint programming [ M ]. Amsterdam, Holland : Elsevier, 2006 : 27 - 78,206 - 235,541 - 580, 778 -781.
  • 10Ojha A K, Biswal K K. Lexicographic multi-objective geometric programming problems [ J ]. IJCSI International Journal of Computer Science Issues, 2009, 6(2): 20-24.

引证文献2

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部