摘要
针对树枝形货物作业点车站的取送车调车作业计划编制问题,以阶段内调车机车总走行时间最小为优化目标,考虑每批作业最晚必须返回车站时刻、车组解体完毕时刻、批次开始时刻、调机最大编挂能力和调移作业所要求的调机访问优先权等约束,建立基于阶段计划的树枝形货物作业点取送车作业优化模型。依据2项原则产生初始解,随机采用3项规则构造邻域解,运用改进的禁忌搜索算法搜寻满意的取送车作业顺序、批次划分及起止时刻。最后应用案例对模型及算法进行了验证,结果表明,所建立的模型和设计的算法是可行有效的,结合阶段计划编制的取送车调车作业计划更有应用价值。
In response to the problem of shunting operation plan for taking-out and placing-in wagon in the station with branch-shaped freight operation sites, in order to minimize the total running time of shunting locomotive in the phase, considering the constraints of the latest time of locomotive returning to the station after each batch of operation, the end time of breaking-up for wagon set, the start time of each batch, the maximum shunting capacity of locomotive and the priority that the transferring operations requires between operation sites, the optimization model of placing-in and taking-out wagon in branch-shaped freight operation sites based on phase plan was formulated. Two principles were used to produce initial solutions, three rules were randomly used to construct neighborhood solutions, and improved tabu search algorithm was applied to look for the satisfactory order, partition and start-stop time of wagon placing-in and taking-out operation. At last, a case was used to validate the model and algorithm. The results show that the model and algorithm provided are feasible and effective, and the shunting operation plan of wagon placing-in and taking-out based on phase plan is more practical.
作者
郭垂江
GUO Chuijiang(School of Logistics, Chengdu University of Information Technology, Chengdu 610103, China)
出处
《铁道学报》
EI
CAS
CSCD
北大核心
2019年第10期10-16,共7页
Journal of the China Railway Society
基金
湖南省高等学校科学研究项目(15C0908)
成都信息工程大学引进人才科研启动项目(KYTZ201910)
关键词
铁道运输
阶段计划
取送车调车作业计划
树枝形货物作业点
禁忌搜索算法
railway transportation
phase plan
shunting operation plan of placing-in and taking-out wagon
branch-shaped freight operation site
tabu search algorithm