考虑集装箱簇边装边卸的港口集卡调度模型求解

文章在集装箱装卸作业问题中,以集装箱簇为作业单位,分两阶段分析集装箱在岸桥集卡间的调度方案,以集卡空驶率最小与移动距离最短为目标,建立了整数规划模型。针对上述模型,文章利用启发式算法与自适应遗传算法对问题进行分析求解。最后通过配置不同集卡数量,将其移动总距离以及空驶效率进行比较,并与禁忌搜索算法相对比。试验结果表明,启发式自适应遗传算法的计算结果在空驶率以及移动总距离最小问题上有更优的解决方案。

Considering loading and unloading of the containers for the model solution on the yard truck scheduling in a container terminal

This paper focused on the question of loading and unloading of containers and analyzed the yard truck scheduling in two stages, with considering the loading and unloading of containers. A mixed integer programming model, where the objective was to minimize the rate of empty-loading and the total distance which was from sum overloading distance and empty-loading distance, was developed. And heuristic algorithm and adaptive genetic algorithm was used to solve the above model. Finally, the mathematical model deployed different quantity of yard trucks were computed by heuristic-adaptive genetic algorithm and by Tabu search algorithm, the result from experiment case proved that the result of the H-AGA is better than that of tabu search algorithm in the problems of the rate of empty-loading and minimum distance of working.