针对码头每日装运计划和动态新任务,以集卡的最小行驶成本为目标函数,建立共享式集卡动态调度模型.通过将动态问题转化为一系列静态问题进行求解,设计了变邻域禁忌搜索算法得到初始静态解,插入算法对该解进行动态调整,并提出两行序列编码.通过实例计算并与其他模型算法比较表明,共享式集卡动态调度模式能大幅减少运输距离,增加集卡重载时间比;而变领域禁忌搜索算法和插入算法可快速求解该模型,得到最优方案.
According to the daily plan and the dynamic task in the container terminal, a mathematical model was es- tablished with sharing all tractors to minimize the running cost. Through solving the static problem transformed by dynamic problem, a variable neighborhood tabu search algorithm was design to obtain the initial static solution, and a plug-in algorithm was utilized to adjust this solution dynamically. A two-line of coding method was put forward. Compared with other algorithms, the proposed shared dynamic scheduling tractors could greatly reduce the running cost and increase the truck load time ratio. While the variable neighborhood tabu search algorithm and the plug-in al- gorithm, this model could be solved quickly and efficiently.