论文部分内容阅读
合理安排取送车顺序对提高机车劳动效率和加速车辆周转具有重要意义。针对树枝形专用线的直达车流取送问题,以车辆在装卸区总停留时间最小为目标函数,满足取送顺序间的逻辑关联约束,建立数学模型。结合后出线者先送、先完工者先取两条准则确定初始方案;引入送车代价和取车代价预先评估方案的有利性,设计隐枚举算法。算例表明:走行时间越离散或装卸时间越集中,寻优进程越缓慢;当专用线数目小于6时能迅速找到最优解,大于6时,设置合理的局部迭代阈值可较快地获得高质量解;获得多个满意解比单个耗费更多时间。
Reasonable arrangements for the order to take the car to improve locomotive labor efficiency and accelerate vehicle turnover is of great significance. Aiming at the problem of picking up and delivering direct traffic flow of tree special lines, the objective function is to minimize the total stay time of vehicles in the loading and unloading area. Combined with the first outlet to send, the first to take the first two guidelines to determine the initial program; the introduction of the cost of delivery and take the car pre-evaluation of the program’s benefits, the design of hidden enumeration algorithm. The example shows that the more the travel time is discrete or the more concentrated the loading and unloading time, the slower the optimization process. When the number of dedicated lines is less than 6, the optimal solution can be quickly found. When the number of special lines is less than 6, the reasonable local iteration threshold can be obtained quickly Quality solutions; getting more satisfied solutions takes more time than individual ones.