集装箱码头物流供应链调度建模与优化研究
发布时间：2018-12-08 17:33
【摘要】：现代物流业已经成为我国大力发展的重要产业,集装箱码头作为典型的物流企业,船舶的大型化发展以及集装箱吞吐量的不断增长,对于空间资源和物流设备资源均有限的集装箱码头提出了严峻的挑战,迫切需要对集装箱码头空间和物流设备等资源进行科学高效的优化调度,以提高其作业效率和精细化管理水平。供应链是十年来的热点研究领域,以往对于供应链的研究大多集中于供应、生产与配送等环节,对于集装箱码头物流供应链调度的研究还比较少,而由于物流供应链内部的紧密联系,对各个环节进行独立的调度常常会导致物流供应链整体作业效率低、运营成本高。本文针对集装箱码头的一系列物流供应链调度问题分别进行了建模和优化研究。通过对物流供应链科学有效的调度,提高集装箱码头的物流作业效率、减少各物流设备之间的等待时间以及降低物流成本,进而提高集装箱码头的服务水平和企业竞争力。吊机是集装箱码头进行装卸和存取作业的重要物流设备,是制约集装箱码头运作效率的主要瓶颈,本文针对集装箱码头与吊机(岸吊和场吊)相关的供应链调度问题进行研究,主要包括以下几个问题：1)泊位和岸吊供应链调度问题；2)单向流的岸吊和集卡供应链调度问题；3)双向流的岸吊和集卡供应链调度问题；4)倒垛和场吊的供应链调度问题。针对上述问题,分别建立了数学模型,并设计了算法进行求解。主要研究内容概述如下：1)针对集装箱码头泊位和岸吊的供应链调度问题进行研究。该问题是指在各泊位的长度、各泊位的可利用岸吊数目以及船舶到港时间等条件已知的情况下,为每条到港船舶分配停泊时间、停泊位置以及服务的岸吊。与以往泊位线呈一条直线的泊位和岸吊分配问题不同,在该问题中,泊位线呈“F”型或者“L”型等包含多条直线的形状。因此,某些相邻的泊位不能被同一条船占用,岸吊也不能在这些泊位之间移动。针对该问题,建立了混合整数规划模型,并提出了拉格朗日松弛算法进行求解,通过分析最优解的性质以及采用加速策略,降低了算法的求解时间。实验结果表明提出的拉格朗日松弛算法在求解小规模和大规模算例时的解与下界的平均对偶偏差分别为1.74%和1.799%。2)针对只含有进港集装箱的岸吊和集卡供应链调度问题进行研究。该问题是指在已知每个集装箱的卸载时间和运输时间等情况下,决策岸吊和集卡的分配以及每台岸吊和每辆集卡操作这些集装箱的顺序。由于只有进港集装箱,只存在从码头前沿到堆场的集卡运输路径,即单向流问题。考虑岸吊之间不允许发生碰撞、卸载集装箱的优先关系等约束条件,以最小化所有集装箱的完成时间为目标建立混合整数线性规划模型,提出了该问题的最优解性质、有效不等式和下界,并设计了基于新的速度更新公式的粒子群算法进行求解。针对该问题进行扩展研究,建立岸吊、集卡和场吊的三阶段供应链调度问题的模型,并设计了求解算法。通过计算实验表明在岸吊、集卡以及场吊中的一种设备数目不变,其它两种设备数目不同的情况下,粒子群算法的结果与最优解的偏差分别为：1.676%,2.033%和0.338%。3)针对同时考虑进港和出港集装箱的岸吊和集卡供应链调度问题进行研究。在对到港船舶进行装卸作业时,往往既有需要从船上卸载下来的进港集装箱,又有需要装载到船上的出港集装箱。在该情况下,集卡运输进港集装箱到达堆场后,可以空载返回码头前沿,也可以从堆场运输出港集装箱返回码头前沿,包含两个方向的集卡运输路径,即双向流问题。针对该问题,建立了线性整数规划模型,并构造了下界,提出了带有速度更新公式选择策略和最差粒子替换策略的粒子群算法求解该问题,计算结果表明所提出的粒子群算法与最优解和下界的平均偏差分别为1.26%和2.48%。4)针对集装箱码头倒垛和场吊的供应链调度问题进行研究。该问题是指在给定一个贝位结构以及外部集卡提取该贝位内每一个集装箱的时间等情况下,同时决策场吊提取该贝位内所有集装箱的顺序以及需要倒垛的集装箱的目标位置。针对倒垛和场吊供应链调度问题,用线性表达恰当地刻画了提箱顺序与倒垛次数的复杂关系,建立了线性整数规划模型,设计了基于部分粒子重新初始化策略的粒子群算法进行求解。实验结果表明将倒垛和场吊进行供应链调度的结果与两者分别进行调度的结果的平均偏差为1.84%。
[Abstract]:The modern logistics industry has become an important industry in the development of our country, and the container terminal is a typical logistics enterprise, the large-scale development of the ship and the continuous increase of the container throughput. There is an urgent need to scientifically and efficiently optimize the container terminal space and logistics equipment, so as to improve its operation efficiency and fine management level. The supply chain is a hot spot research field in the past ten years. In the past, the research on the supply chain is mainly focused on the supply, production and distribution. The research on the supply chain scheduling of the container terminal is less, and due to the close contact inside the logistics supply chain, Independent scheduling of each link often results in lower overall operation efficiency and high operating cost of the logistics supply chain. In this paper, the modeling and optimization of a series of logistics supply chain scheduling problems for container terminal are studied. Through the scientific and effective scheduling of the logistics supply chain, the logistics operation efficiency of the container terminal can be improved, the waiting time between the logistics equipment and the logistics cost can be reduced, and the service level and the enterprise competitiveness of the container terminal can be further improved. The crane is an important logistics equipment for loading and unloading and accessing the container terminal, which is the main bottleneck that restricts the operation efficiency of the container terminal. This paper studies the supply chain scheduling problem associated with the crane (bank and field crane) of the container terminal, which mainly includes the following problems: 1) the scheduling problem of the supply chain of the berth and the bank; 2) the problem of the supply chain of the bank of the one-way flow and the supply chain of the current collector; 3) the problem of the supply chain of the bank and the current collector of the two-way flow; and 4) the problem of supply chain scheduling of the stack and the field crane. In view of the above problems, a mathematical model is set up, and the algorithm is designed to solve the problem. The main research contents are as follows: 1) The supply chain scheduling problem for the container terminal berth and the shore crane is studied. The problem is to assign the berth time, the mooring position and the shore crane for each port to the port where the length of each berth, the number of available shore cranes for each berth, and the time of the arrival of the ship are known. The berth line is in the form of a 鈥淔鈥，
本文编号：2368726
[Abstract]:The modern logistics industry has become an important industry in the development of our country, and the container terminal is a typical logistics enterprise, the large-scale development of the ship and the continuous increase of the container throughput. There is an urgent need to scientifically and efficiently optimize the container terminal space and logistics equipment, so as to improve its operation efficiency and fine management level. The supply chain is a hot spot research field in the past ten years. In the past, the research on the supply chain is mainly focused on the supply, production and distribution. The research on the supply chain scheduling of the container terminal is less, and due to the close contact inside the logistics supply chain, Independent scheduling of each link often results in lower overall operation efficiency and high operating cost of the logistics supply chain. In this paper, the modeling and optimization of a series of logistics supply chain scheduling problems for container terminal are studied. Through the scientific and effective scheduling of the logistics supply chain, the logistics operation efficiency of the container terminal can be improved, the waiting time between the logistics equipment and the logistics cost can be reduced, and the service level and the enterprise competitiveness of the container terminal can be further improved. The crane is an important logistics equipment for loading and unloading and accessing the container terminal, which is the main bottleneck that restricts the operation efficiency of the container terminal. This paper studies the supply chain scheduling problem associated with the crane (bank and field crane) of the container terminal, which mainly includes the following problems: 1) the scheduling problem of the supply chain of the berth and the bank; 2) the problem of the supply chain of the bank of the one-way flow and the supply chain of the current collector; 3) the problem of the supply chain of the bank and the current collector of the two-way flow; and 4) the problem of supply chain scheduling of the stack and the field crane. In view of the above problems, a mathematical model is set up, and the algorithm is designed to solve the problem. The main research contents are as follows: 1) The supply chain scheduling problem for the container terminal berth and the shore crane is studied. The problem is to assign the berth time, the mooring position and the shore crane for each port to the port where the length of each berth, the number of available shore cranes for each berth, and the time of the arrival of the ship are known. The berth line is in the form of a 鈥淔鈥，
本文编号：2368726
本文链接：https://www.wllwen.com/jingjilunwen/jtysjj/2368726.html
