针对集装箱堆场进口集装箱的提箱作业计划问题,建立了以作业总成本最小为目标的多阶段决策优化模型,构造了内外嵌套两层结构的优化算法,内层算法实现最短路径搜索子模型,外层算法实现倒箱策略优化子模型。对内外层优化算法,设计了基于启发式A^*与GA算法分别组合的4种方案。实例分析表明:各算法组合方案具有相同的有效性,当问题规模较小时,A^*+A^*较好,但问题规模增大时,GA+GA较好。
This paper presents a multi-stage mathematical programming model for container pick-up operations scheduling. This model is based on a nested algorithm structure which contains two layers. The outer layer algorithm is responsible for optimizing the strategies of remanding operations; while the inner layer algorithm, which is depended on the results of the outer layer algorithm, is designed for searching the shortest path of remanding operations. Two algorithms, the A^* algorithm and genetic algorithm (GA) are adopted for the calculations of both inner and outer layers. Four possible combinations of using A^* and GA (A^*+A^* ,A^*+GA, GA+A^* , and GA+GA for inner and outer layers respectively) are tested on randomly generated container pick-up requirements. The result shows that all four combinations will generate the optimal operations sequence with a minimized total operation cost. However, the A^* +A^* method converges fastest when the scale of the operations is small; and the GA+ GA approach has the highest search efficiency in large-scale problems.