论文部分内容阅读
以集装箱码头物流运作管理为研究背景,研究集装箱的装船计划问题(Container Stowage Planning Problem,CSPP)。在考虑船体结构以及具体的装载要求的基础上来确定集装箱装载计划中每个集装箱在船舶上的具体空间位置。对此问题构建整数规划模型,目标函数考虑总的装载时间以及船舶上bay位之间的装载量。为近似求解此问题,设计禁忌搜索算法。在算法实施中,把该问题分为两阶段问题并依次求解以获得整个问题的初始解,提出大范围搜索和深度搜索的混合搜索策略用于改进算法,并设计基于计算目标函数改进量的加速策略。通过实验表明,提出的禁忌搜索算法与CPLEX所获得的最优解或下界进行比较,平均偏差值为1.95%。
With container terminal logistics operation and management as the research background, Container Container Planning Problem (CSPP) is studied. Based on the hull structure and the specific loading requirements, the specific spatial position of each container on the vessel in the container loading plan is determined. An integer programming model is constructed for this problem, with the objective function taking into account the total loading time and the loading capacity between the bays on the ship. To approximate this problem, tabu search algorithms are designed. In the implementation of the algorithm, the problem is divided into two stages and solved in order to obtain the initial solution of the whole problem. A hybrid search strategy of large-scale search and depth search is proposed to improve the algorithm and the design is based on the calculation of the acceleration of the objective function to improve Strategy. Experiments show that the proposed tabu search algorithm and CPLEX obtained the optimal solution or lower bound, the average deviation of 1.95%.