编组计划,">技术直达列车,">禁忌搜索算法,0~1规划, 编组计划,">技术直达列车,">禁忌搜索算法,0~1规划, formation plan, 0~1 program,"/> <span style="font-size: 10.5pt;">技术站单组列车编组计划的禁忌搜索算法研究</span>

山东科学 ›› 2016, Vol. 29 ›› Issue (3): 81-86.doi: 10.3976/j.issn.1002-4026.2016.03.014

• 交通运输 • 上一篇    下一篇

技术站单组列车编组计划的禁忌搜索算法研究

张海舰   

  1. 郑州铁路局安阳车务段,河南安阳455000
  • 收稿日期:2016-01-05 出版日期:2016-06-20 发布日期:2016-06-20

Tabu search algorithm for the formation plan of Single-group train at technical service station

Zhang Hai-jian   

  1. Anyang Train Operation Depot, Zhengzhou Railway Administration, Anyang 455000, China
  • Received:2016-01-05 Online:2016-06-20 Published:2016-06-20

摘要:

技术站列车编组计划是铁路运输组织工作中的难点之一?国内现有对单组列车编组计划的研究,以运用0~1规划研究编组去向的车流递推关系最为典型,这类研究的本质在于优化各支车流的第一到站?基于此,本文设计了一种实数编码的禁忌搜索算法,可用来求解路网性列车编组计划?算例表明该算法能快速?有效地求解技术站单组列车编组计划?与LINGO软件相比,禁忌搜索算法只需较少的时间便可搜索到全局最优解?

关键词: 编组计划')">">编组计划, 技术直达列车')">">技术直达列车, 禁忌搜索算法')">">禁忌搜索算法, 0~1">0~1规划')">">规划, Train formation plan of technical stations is one of key issues for railway transportation schedule. The most popular algorithm is 0~1 program involving train flow recursion relation of train formation destination among the present domestic research on single train formation plan. The essential of such research is to optimize the first arrival station of wagon flows. We therefore devise a real number coded tabu search algorithm that can be applied to solving train formation plan of railway network. Computational cases indicate that it can rapidly and effectively solve formation plan of single-group train at technical service stations. Compared with LINGO software, it can find global optimum solution with only less time.

Key words: technical through train, tabu search algorithm, formation plan')">formation plan, 0~1 program

中图分类号: 

  • 引用本文

    张海舰. 技术站单组列车编组计划的禁忌搜索算法研究[J]. 山东科学, 2016, 29(3): 81-86.

    Zhang Hai-jian. Tabu search algorithm for the formation plan of Single-group train at technical service station[J]. SHANDONG SCIENCE, 2016, 29(3): 81-86.