集装箱堆场（预）翻箱问题建模与优化研究

发布时间：2018-03-10 02:09

本文选题：预翻箱　切入点：翻箱　出处：《武汉理工大学》2013年硕士论文　论文类型：学位论文

【摘要】：随着我国经济的持续快速发展,港口集装箱吞吐量快速增加,港口码头集装箱拥堵和港口压船现象不断出现。如何提高港口集装箱码头的装卸速度和吞吐效率,从而减少船舶在港停泊时间成为我国集装箱码头的当务之急。在集装箱堆场,影响装船效率的主要因素之一是堆场翻箱问题,除了对装船时取箱过程中的翻箱问题进行优化,提高装船效率的另一种方法就是对集装箱进行预翻箱整理,使得集装箱的堆放顺序符合取箱顺序,以尽量减少取箱装船过程中的翻箱次数。本文以集装箱堆场单贝位出口箱装船时和装船前的翻箱过程为研究对象,对其进行优化,从而减少翻箱次数,达到提高集装箱码头装船效率的目的。本文首先介绍了集装箱堆场和(预)翻箱问题,分析了翻箱操作产生的原因和其造成的影响,分析了降低翻箱次数的重要性和解决方法；然后提出了集装箱堆场单贝位出口箱装船时翻箱问题的假设,构建了翻箱问题的整数模型,结合贝位规模和箱子数量不断变化的翻箱案例,利用分支定界精确算法对其进行了优化,并对优化结果进行了分析。鉴于集装箱堆场装船时翻箱问题属于组合优化问题,具有NP特性,在问题规模较大时利用分支定界算法难以或者无法在可以忍受的时间内得到最优解,因而本文针对装船时翻箱过程中落箱位置的箱位选取设计了启发式规则,利用visual c++编写了翻箱问题的程序,结合贝位规模及集装箱数量不断变化的翻箱问题随机案例,对其进行了优化,并对优化结果进行了分析,同时和分支定界算法的优化结果进行了比较,验证了其正确性。由于启发式算法本身的特性,其对问题进行优化得到的解只能是问题的近优解或可行解,本文基于问题空间搜索算法的思想对提出的启发式算法作了进一步改进。本文提出了集装箱堆场单贝位出口箱装船前预翻箱问题的假设,构建了装船前预翻箱问题的整数数学模型,利用分支定界精确算法对预翻箱随机案例进行了求解优化,并对优化结果进行了分析。优化实验结果及其分析表明：1)分支定界算法能够结合数学模型获得问题的精确解或最优解,但随着贝位规模及箱子数量的增大,时间成本呈指数增加；2)启发式算法及基于问题空间搜索的改进启发式算法,能在较短时间内得到问题的近优解或可行解；3)随着案例规模的增大,改进后的启发式算法能够较改进前的启发式算法得到质量更高的解。
[Abstract]:With the continuous and rapid development of economy in our country, the container throughput of the port increases rapidly, the container congestion of the port terminal and the phenomenon of loading and unloading in the port constantly appear. How to improve the loading and unloading speed and the throughput efficiency of the port container terminal? In the container yard, one of the main factors affecting the loading efficiency is the problem of loading yard turnover, except for the optimization of the turning over of the container during the process of loading and taking out the container, so as to reduce the time of ship berthing in the port of our country, and to reduce the berthing time of the ship in the port becomes the urgent matter for the container terminal in our country. Another way to improve the efficiency of loading is to pre-turn the containers so that the stacking order of the containers conforms to the order of taking out the containers. In order to reduce the number of times of turning over the container during loading, this paper takes the process of turning over the container during loading and before loading of the single shell exit box in the container yard as the research object, and optimizes it so as to reduce the times of turning over the container. To achieve the purpose of improving the loading efficiency of container terminal. In this paper, the problems of container yard and (pre) turnover are introduced, the causes and effects of the operation are analyzed, and the importance and solution of reducing the times of turning over are analyzed. Then it puts forward the hypothesis of the problem of turning over the container during the loading of the single shell exit box in the container yard, and constructs an integer model of the problem of turning over the box, combining with the case of the changing of the scale of the shell and the number of the box. The branch and bound algorithm is used to optimize the algorithm, and the optimization results are analyzed. In view of the combinatorial optimization problem when loading container yard, which has NP characteristic, it is difficult or intolerable to obtain the optimal solution by using branch and bound algorithm when the scale of the problem is large. In this paper, a heuristic rule is designed to select the position of the drop box during loading, and a program is developed by using visual c, combining with the random case of the changing size of the shell and the quantity of the container. The optimization results are analyzed and compared with the optimization results of the branch and bound algorithm. The correctness of the heuristic algorithm is verified. The optimal solution to the problem can only be the near optimal solution or the feasible solution. Based on the idea of the problem space search algorithm, the heuristic algorithm is further improved in this paper. In this paper, the hypothesis of the pre-overturning problem of single-shell exit container in container yard is proposed, and the integer mathematical model of pre-turning box problem before loading is constructed, and the stochastic case of pre-overturning box is solved and optimized by using the exact algorithm of branch and bound. The optimization results are analyzed. The results of the optimization experiment and its analysis show that the branch and bound algorithm can be combined with mathematical model to obtain the exact solution or the optimal solution of the problem, but with the increase of the size of the shell and the number of boxes, The time cost increases exponentially and the heuristic algorithm and the improved heuristic algorithm based on the search of problem space can get the near optimal solution or feasible solution of the problem in a relatively short time) with the increase of the case scale. The improved heuristic algorithm can get a higher quality solution than the improved heuristic algorithm.
【学位授予单位】：武汉理工大学
【学位级别】：硕士
【学位授予年份】：2013
【分类号】：U695.22

【参考文献】