【作者】 李娜；

【导师】 靳志宏；

【作者基本信息】 大连海事大学 ， 物流工程与管理， 2011， 博士

【摘要】 泊位是集装箱码头的稀缺资源,岸桥是集装箱码头最昂贵的设备之一,如何合理地利用泊位与岸桥资源,缩短船舶在港时间,从而提高码头的服务质量,提升其竞争力,是码头生存和发展的根本。针对泊位和岸桥调度问题,本文系统地归纳和评述了大量的相关文献,发现目前对于连续泊位和岸桥分配问题的研究仍不够理想,对于多船动态岸桥调度问题的研究还比较缺乏,而基于任务的连续泊位与岸桥调度联合优化的研究则刚刚起步。因此,连续泊位与岸桥的协调调度问题还需要进一步改进和完善。围绕上述问题,本文主要进行了以下几方面的研究工作：(1)在充分考虑可能的现实约束前提下,对连续泊位与岸桥分配问题构建了数学模型,并提出三种求解算法。算例实验的结果表明所建立的模型比较符合问题的特征,设计的遗传算法具有较好的适应性。(2)研究了多船多任务的岸桥调度问题,基于一个可行的泊位计划,构建了多船动态岸桥调度模型,设计了有针对性的遗传算法求解。在算例实验中,进行了三组比较。一是用设计的模型和算法求解单船调度基准问题,并与其结果对比分析；二是多船多任务的岸桥调度与单船独立调度的比较；三是对多台岸桥调度问题的仿真结果比较,从而验证了模型和算法的有效性。(3)针对泊位调度、岸桥分配、岸桥调度三方面与泊位岸桥调度相关的关键环节,建立了集成优化模型,基于遗传进化的思想,开发了一体化求解算法。利用VB6.0编译所设计的算法分别求解四组大规模算例实验,并通过与分阶段调度相比较,验证了模型和算法有较好的应用效果。对模型中涉及的相关参数进行了敏感性分析,分析的结果较客观地反映了问题的本质。更多还原

【Abstract】 The berth is the scarce resource at container terminals. And quay crane is one of the most expensive equipments. To use the berth and quay cranes reasonablly is the key factor for surviving and development, so as to decrease the total time spent at port and to improve the service quality and competative competence. As to berth and quay scheduling problems, a large amont of lieratures related are reviewed and summarized. The solutions on continuous berth scheduling and quay crane allocation problem are still not satisfying. Relatively little work has been done in dynamic quay crane schedulig among multiple ships. And the research on coordinated optimization of continuous berth and quay crane scheduling based on tasks has taken initial step at present. So the research on continuous berth and quay crane scheduling needs to be further improved. The main work in this dissertation about the above problems is as follows:(1) Under the fully consideration of possible practical constraints, a new mathematical modal is set up on continuous berth and quay crance allocation problem. And three kinds of algorithm are proposed. The results of numerical experiments indicate that the modal is in accordance with prolem characteristics and the proposed genetic algorithm is adaptive.(2) The quay crane scheduling problem among multiple ships with multiple tasks is studied. Under a feasible berth plan, a quay crane scheduling modal among multiple ships is set up. And an applicable genetic algorithm is designed. Through numerical experiments, three contrasts are conduct. The benchmark problem of quay crane scheduling on single ship is solved by the proposed modal and algorithm, the results of which is compared with those of lietrature. The second one is comparisons of scheduling results between multi-ships and single ship. And the last one is simulation comparison of quay crane dynamic scheduling among multi-ships. So, the effectiveness of the model and the algorithm is demonstrated. (3) The key phases of berh and quay crance scheduling, including berth scheduling, quay crane allocation and quay crane scheduling, are integrated in the optimization modal. The integrated algorithm is developed based on genetic algorithm. With VB 6.0 software, the algorithm is programmed to solve the four sets of large amount numerical experiments. Through comparisons with seperated secheduling, the application effect of the modal and the algorithm is proved. The sensibility of related parameters in the modal are analyzed, the results of which relfect the fact of the problem objectively.更多还原