集装箱码头泊位和岸桥联合鲁棒调度的建模与优化
发布时间:2018-02-05 01:44
本文关键词: 集装箱码头 泊位分配 岸桥调度 鲁棒性 遗传算法 实时调度 出处:《天津理工大学》2014年硕士论文 论文类型:学位论文
【摘要】:随着经济全球化进程的不断加快,世界各国之间的贸易往来日趋频繁,集装箱海上运输已成为连接全球供应链的重要环节,集装箱码头作为集装箱海上运输与陆地运输的交汇点,在国际运输网络中扮演着越来越重要的角色。随着国际竞争的不断加剧、以及国际货物贸易量的不断增加,集装箱码头面临的挑战也越来越严峻,其资源优化作业问题已成为物流领域研究的热点问题,而如何合理有效地分配泊位和岸桥资源,尤其是提高泊位和岸桥作业计划在不确定环境下的抗干扰能力,受到了研究者和业界管理人员重视。因此,本文对不确定环境下的泊位分配和岸桥分配的联合鲁棒调度问题进行了研究,主要内容如下:首先,研究了不确定环境下的连续泊位和岸桥联合鲁棒调度的预调度计划问题,提出了基于时间冗余策略的泊位和岸桥联合调度预分配模型。本文所提出的模型在引入缓冲时间作为鲁棒性指标的同时,引入船舶计划延误时间的加权和作为服务性指标,并以船舶的装卸作业量作为其靠泊服务权重,以体现决策者对于不同装卸量船舶的延误时间的重视程度。模型通过对预计到港船舶的计划靠泊时刻、靠泊位置和分配岸桥数量进行决策,以实现最小化所有靠泊船舶的延误时间加权和(服务性指标)、最大化缓冲时间(鲁棒性指标)的目标。由于服务性指标和鲁棒性指标存在着冲突,本文在以二者的加权和作为目标函数的前提下,通过调整权重参数对方案的鲁棒性和服务性进行权衡。然后,对鲁棒泊位和岸桥联合调度模型进行了深入的分析,得到了该数学模型的可行解和最优解的一系列相关性质,证明了该问题一定存在一个最优的左下紧计划方案。因此,提出了一种基于改进遗传算法的求解最优(近似最优)左下紧方案的求解算法,并提出了一种对左下紧方案进行改进的松弛化处理方法。仿真实验结果证明了本文提出的模型和求解算法的有效性。最后,建立了不确定环境下岸桥实时调度问题的数学模型,针对实际调度过程中不确定因素的干扰,通过对实时调度问题数学模型的求解得到了实时岸桥调度策略,仿真实验表明,岸桥的实时调整进一步提高了码头集装箱装卸作业的抗扰动能力。
[Abstract]:With the accelerating process of economic globalization, the trade between countries in the world is becoming more and more frequent, container maritime transport has become an important link to connect the global supply chain. Container terminal, as the intersection of container transportation by sea and land transport, plays an increasingly important role in the international transportation network. With the increasing volume of international trade in goods, container terminals are facing more and more serious challenges. The optimization of their resources has become a hot issue in the field of logistics. However, how to allocate berths and quayside resources reasonably and effectively, especially to improve the anti-interference ability of berths and shore bridge operation plan in uncertain environment, has been paid attention to by researchers and industry managers. In this paper, the joint robust scheduling problem of berth allocation and shore bridge allocation in uncertain environment is studied. The main contents are as follows: first. In this paper, the problem of joint robust scheduling of continuous berths and quayside bridges in uncertain environments is studied. A preallocation model of berth and quayside joint scheduling based on time redundancy strategy is proposed. The proposed model introduces buffer time as a robust index. The weighted sum of the scheduled delay time is introduced as the service index, and the loading and unloading capacity of the ship is taken as the weight of the berthing service. In order to reflect the importance of decision makers to the delay time of ships with different loading and unloading capacity, the model makes decisions on the planned berthing time, berthing position and allocation of the number of quayside bridges for ships arriving at port. In order to achieve the goal of minimizing the weighted sum of delay time (service index) and maximizing buffer time (robustness index) of all berthing vessels, there is a conflict between service index and robust index. In this paper, the weighted sum of the two is taken as the objective function, and the robustness and service of the scheme are weighed by adjusting the weight parameters. Then. In this paper, the robust berth and shore bridge joint scheduling models are analyzed in depth, and a series of related properties of the feasible and optimal solutions of the mathematical model are obtained. It is proved that there must be an optimal left-down compact plan for this problem. Therefore, an improved genetic algorithm is proposed to solve the optimal (approximately optimal) left-down compact scheme. An improved relaxation processing method for the left-lower compact scheme is proposed. The simulation results show the effectiveness of the proposed model and the algorithm. Finally. The mathematical model of the real-time scheduling problem of shore bridge in uncertain environment is established. Aiming at the disturbance of uncertain factors in the actual scheduling process, the real-time scheduling strategy is obtained by solving the mathematical model of the real-time scheduling problem. The simulation results show that the real-time adjustment of the quayside bridge can further improve the anti-disturbance ability of container handling operations.
【学位授予单位】:天津理工大学
【学位级别】:硕士
【学位授予年份】:2014
【分类号】:U691.3
【参考文献】
相关期刊论文 前9条
1 计明军;靳志宏;;集装箱码头集卡与岸桥协调调度优化[J];复旦学报(自然科学版);2007年04期
2 孙凤山;;港口发展集装箱物流的优势和途径[J];港口经济;2007年02期
3 姜长元;;动态信息素更新蚁群算法在指派问题中的应用[J];计算机工程;2008年15期
4 银路;李天柱;;情景规划在新兴技术动态评估中的应用[J];科研管理;2008年04期
5 王芳;;不确定性因素对我国农村居民现金消费支出的影响分析[J];数理统计与管理;2006年04期
6 陈秋双;杜玉泉;徐亚;;不确定环境下集装箱码头的扰动管理[J];物流技术;2010年Z1期
7 周鹏飞;康海贵;;面向随机环境的集装箱码头泊位-岸桥分配方法[J];系统工程理论与实践;2008年01期
8 孙彬;孙俊清;陈秋双;;基于鲁棒反应式策略的泊位和岸桥联合调度[J];系统工程理论与实践;2013年04期
9 张越;;国际集装箱运输市场2012年回顾与2013年展望[J];中国水运;2013年01期
相关会议论文 前1条
1 孙彬;孙俊清;刘凤连;杨鹏;韩梅;冯美玲;;基于蚁群算法的鲁棒离散泊位分配问题的研究[A];第二十九届中国控制会议论文集[C];2010年
,本文编号:1491757
本文链接:https://www.wllwen.com/guanlilunwen/gongyinglianguanli/1491757.html