集装箱码头场桥调度优化模型与算法研究

发布时间：2018-03-19 22:25

本文选题：码头场桥　切入点：路径优化　出处：《大连海事大学》2015年硕士论文　论文类型：学位论文

【摘要】：集装箱运输作为一种先进的运输组织形式,在国内外被广泛采用。集装箱码头,是集装箱运输的一个关键节点。随着集装箱运输量的增加,集装箱码头作业所承受的压力增大。资源配备、信息技术及经营管理方式等都是影响集装箱码头作业水平的重要因素。在码头已有的资源配置下,如何提高资源的作业效率,是亟待解决的问题。本文即在此环境下,对集装箱码头内场桥的调度进行优化研究,旨在通过优化场桥的移动路径,缩短其作业时间,达到资源的有效利用。本文以集装箱码头内场桥为研究对象,运用运筹学中线性规划、动态规划等优化理论与方法,研究场桥调度的优化问题。建立了两阶段规划的数学模型,第一阶段建立线性约束的混合整数规划模型,确定子任务内场桥需要进行作业的贝位号和在对应贝位上的取箱数量；第二阶段将研究问题分单场桥和多场桥两种情况进行解决,以总移动距离最小为目标,确定场桥在进行任务时作业贝位号的顺序,结合第一阶段求得的取箱数量,最终获得每台场桥进行任务时作业的贝位号序列和对应贝位上的取箱数量。本文设计了线性规划和动态规划相结合的算法,第一阶段首先对研究问题进行线性化和连续化,运用单纯形法求得使所有场桥在完成总任务时需要进行作业的贝位数量最少的集合和在对应贝位上的取箱数量；第二阶段采用动态规划的方法,考虑场桥在作业每个子任务及之后的五个子任务,选择场桥移动距离最小的贝位号进行作业,确定场桥在完成所有任务时作业的贝位号序列。另外,将本文采用的模型与混合整数规划模型进行了对比分析,也对比分析了本文算法与模拟退火算法、遗传算法和随机搜索式算法等算法的特点,通过算例验证表明本文数学模型的合理性和算法的高效性,能够有效的提高码头场桥的作业效率,减少作业时间,提高码头装卸资源的工作效率。
[Abstract]:Container transportation, as an advanced form of transportation organization, is widely used at home and abroad. Container terminal is a key node of container transportation. The pressure on container terminal operation is increased. Resource allocation, information technology and management mode are all the important factors that affect the operation level of container terminal. Under the existing resource allocation of container terminal, how to improve the efficiency of resource operation. In this paper, the optimal scheduling of the container terminal inner yard bridge is studied in order to shorten the operation time by optimizing the moving path of the yard bridge. In this paper, the optimization problem of field bridge scheduling is studied by using the optimization theory and method of linear programming and dynamic programming in operation research, and the mathematical model of two-stage planning is established. In the first stage, a mixed integer programming model with linear constraints is established to determine the number of shells and the number of boxes to be fetched on the corresponding shell-level. In the second stage, the problem is solved in two cases: single-field bridge and multi-field bridge. With the aim of minimizing the total moving distance, the order of the operational shell number of the field bridge during the task is determined, and combined with the number of boxes obtained in the first stage, Finally, the number sequence of each field bridge and the number of boxes on the corresponding shell are obtained. In this paper, a linear programming and dynamic programming algorithm is designed. In the first stage, the research problem is linearized and continuous. The simplex method is used to obtain the set of the minimum number of shells and the number of boxes to be taken from the corresponding shells when all field bridges are required to complete the total task. In the second stage, dynamic programming method is used. Considering each subtask and the following five subtasks of the field bridge, select the shell number with the smallest moving distance for the field bridge to determine the sequence of the job's shell number when the field bridge completes all the tasks. In addition, The model used in this paper is compared with the mixed integer programming model, and the characteristics of the algorithm, such as simulated annealing algorithm, genetic algorithm and random search algorithm, are compared and analyzed. The results show that the rationality of the mathematical model and the efficiency of the algorithm can effectively improve the efficiency of the terminal yard bridge, reduce the operation time, and improve the efficiency of the handling resources of the wharf.
【学位授予单位】：大连海事大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U691.3

【参考文献】