摘要
确定到达列车的解体顺序和出发列车的编组顺序(即列车解编方案)是技术站编组调机运用计划的核心问题.本文为解决该问题,构建相应的优化模型,利用结合邻域搜索的和声搜索算法进行求解,采用目标函数值评价新的和声,邻域搜索策略用于获取新的和声.最后利用算例对所设计算法的求解效率进行分析验证,表明:算法收敛速度较快,而与邻域搜索策略的结合,有利于扩展其搜索范围与提升全局搜索能力,降低对选择概率的依赖.通过对不同参数条件下计算时间的测试说明,所设计算法能够满足技术站编组列车解编方案编制的要求.
The break-up sequence of inbound trains and the make-up sequence of outbound trains are the core problem of the yard engine utilization plan in the railway technical station, which is a NP-C. This paper presents harmony search algorithm combined with neighborhood search strategy to solve this problem. The paper defines the operate strategy of harmony memory （HM）, and the evaluate method of new harmony, which is generated by the neighborhood search strategy. A numerical example is proposed to validate the efficiency of the designed algorithm. This algorithm can converge very fast to the optimal solution. The neighborhood search strategy can improve the global searching ability of the algorithm by expanding the search space, and lessen the dependence on select probabilities. The testing time under different parameters of the algorithm proves that the designed algorithm can fulfill the requirement of planning the break-up sequence of inbound trains and make-up sequence of outbound trains in railway technical station.
出处
《北京交通大学学报》
CAS
CSCD
北大核心
2013年第3期107-111,共5页
JOURNAL OF BEIJING JIAOTONG UNIVERSITY
基金
国家"973"计划项目资助(2012CB725403)
铁道部科技研究开发计划项目资助(2012X012-E)
中央高校基本科研业务费专项资金资助(2012YJS068)
关键词
技术站
列车解编顺序
和声搜索
邻域搜索
railway technical station
train break-up and make-up sequence
harmony search algorithm
neighborhood search
