论文部分内容阅读
在实际路网下建立了空挂任务不确定情形下的甩挂运输调度优化模型,设计两阶段启发式算法进行求解,第1阶段分别按照空挂调运距离最小和重挂任务起终(OD)点总顺差最低2种策略确定空挂调运方案,第2阶段结合任务节点顺差和贪婪思想确定所有任务的执行序列,采用算例分析算法的性能。分析结果表明:空挂运输成本与总成本分别为325.5、1 010.5元,比原有方案分别节约10.44%、3.62%,且使用的牵引车更少;基于辽宁省内城市间甩挂运输算例所得空挂调运距离最小和重挂任务OD点总顺差最低2种策略的最优值分别为2 561.3、2 464.6元,平均求解时间分别为21.5、27.3s,第2种策略各结果的稳定性较好;模拟退火算法所得总成本均在3 100元以上,求解时间均在80s以上。可见,本文算法的精度和效率较高,重挂任务OD点总顺差最低策略在求解空挂任务不确定情形下的甩挂运输调度问题方面有着明显的优势。
In the actual road network under the uncertainty of empty-hanging task under the circumstances of the hanging transport scheduling optimization model designed two-stage heuristic algorithm to solve, the first phase were empty hanging according to the minimum distance and the re-transmission task from start to finish (OD) In the second stage, the execution sequence of all the tasks is determined by taking advantage of the task node’s surplus and greed, and the performance of the algorithm is analyzed by an example. The results show that the cost of air transportation and the total cost are respectively 325.5 and 110.5 yuan, saving 10.44% and 3.62% respectively compared with the original scheme and using fewer tractors. Based on the example of hanging transport between cities in Liaoning Province The optimal values of the two strategies with the lowest distance of airborne transportation and the lowest point of total OD of the reloading mission were respectively 2 561.3 and 2 464.6 yuan and the average solution times were 21.5 and 27.3s respectively. The stability of each result of the second strategy Better; the total cost of the simulated annealing algorithm are more than 3,100 yuan, the solution time is more than 80s. It can be seen that the accuracy and efficiency of the algorithm in this paper are high, and the strategy of lowest total odds of OD points in re-attach tasks has obvious advantages in solving the problem of throttling transport scheduling problem under the uncertain situation of empty-hanging tasks.