集装箱码头动态连续型泊位分配问题研究

发布时间：2018-01-05 05:14

本文关键词：集装箱码头动态连续型泊位分配问题研究　出处：《大连海事大学》2015年硕士论文　论文类型：学位论文

【摘要】：泊位是集装箱码头的稀缺资源,合理制定靠泊计划,提高泊位利用率,缩短船舶在港时间,增加码头生产利润,从而提升码头对客户的服务水平以及在整个行业内的竞争力,是集装箱码头不断发展的重要途径。针对泊位分配问题,本文系统归纳和总结了泊位分配的相关文献,发现目前对于动态连续型泊位分配问题的研究仍不是十分理想,因此,动态连续型泊位分配问题还需要进一步地改进和完善。本文研究的问题是集装箱码头动态连续型泊位分配问题,属于单一环节的调度优化问题。典型的泊位分配问题有两种：离散型泊位分配和连续型泊位分配。前者的优势在于可以方便地安排泊位分配计划但是不能有效地利用码头岸线,后者则具有完全相反的特点。在集装箱船舶箱位大幅增长的趋势下,在有多种船型的船舶挂靠的枢纽港需要更加灵活的泊位分配计划。本文在集卡调度成本基于靠泊位置的假设前提下,以码头服务船舶的总成本最小化为目标,根据问题特性设计禁忌搜索算法来求解集装箱码头动态连续型动态泊位分配问题。对此本文进行了数据实验,证明了禁忌搜索算法对解决该问题有较好的效果。最后基于离散系统仿真理论,利用集装箱码头仿真软件FlexTerm对算例结果进行了仿真分析,证明了算法的有效性和可靠性。
[Abstract]:Berth is a scarce resource of container terminal. It can make berthing plan rationally, improve berth utilization ratio, shorten ship's time in port and increase the profit of wharf production. To improve the terminal service level to customers and the competitiveness of the entire industry is an important way for the continuous development of container terminals. In this paper, the related literature on berth allocation is summarized systematically, and it is found that the research on dynamic continuous berth assignment is still not very ideal. The dynamic continuous berth allocation problem needs to be further improved and improved. The problem studied in this paper is the dynamic continuous berth allocation problem of container terminals. There are two typical berth allocation problems:. The advantage of discrete berth allocation and continuous berth allocation is that the former can arrange berth allocation plan conveniently but can not make effective use of wharf shoreline. The latter has the opposite characteristics. Under the trend of large increase of container space. A more flexible berth allocation plan is needed in a hub port with multiple ship types. This paper aims at minimizing the total cost of terminal service under the assumption that the card collection scheduling cost is based on the berthing position. Tabu search algorithm is designed according to the characteristics of the problem to solve the dynamic continuous berth assignment problem of container terminal. The Tabu search algorithm is proved to be effective in solving this problem. Finally, based on the theory of discrete system simulation, the simulation results of container terminal simulation software FlexTerm are simulated and analyzed. The validity and reliability of the algorithm are proved.
【学位授予单位】：大连海事大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U691.3

【参考文献】