摘要
针对树枝形货物作业点车站的取送车调车作业计划编制优化问题，以阶段内调车机车总走行时间最小为优化目标，考虑车组解体完毕时刻、每批作业最晚必须返回车站时刻、批次开始时刻、调机最大编挂能力和调移作业所要求的调机访问优先权等约束，建立了基于阶段计划的树枝形货物作业点取送车作业优化模型。依据3项原则产生初始解，运用禁忌搜索算法搜寻满意的取送车作业顺序、批次划分及起止时间。
For the problem of shunting operation plan for taking-out and placing-in wagons in branch- shaped freight operation sites, taking the total running time of shunting locomotive as the optimization objective, considering the constraints of the end time of breaking-up for wagon set, the latest time of locomotive returning to the station after each batch of operation, the start time of each batch, the capacity of locomotive and the priority that the transferring operations requires between operation sites, the optimization model of placing-in and taking-out wagons in branch-shaped freight operation sites based on phase plan is formulated. Three principles are used to produce initial solution and tabu search is applied to look for the satisfactory order, partition and start stop time of placing-in and taking-out wagons operation.
出处
《湖南铁路科技职业技术学院学报》
2017年第2期34-39,共6页
Vocational Education Research on Rail Transit
基金
湖南省高等学校科学研究项目《铁路车站取送车作业多目标优化模型及模拟退火算法》,项目编号：15C0908
关键词
阶段计划
取送车调车作业计划
树枝形货物作业点
禁忌搜索算法
Phase plan
Shunting operation plan of placing-in and taking-out wagons
Branch-shaped freight operation sites
Tabu search algorithm
