Computer Engineering and Applications ›› 2020, Vol. 56 ›› Issue (13): 262-272.DOI: 10.3778/j.issn.1002-8331.1812-0286
Previous Articles Next Articles
DING Yi, TIAN Liang, GONG Jie
Online:
Published:
丁一,田亮,龚杰
Abstract:
Based on the difference between the layout and the mechanical configuration of the automated container terminal yard and the traditional yard, the factor of the block operation balance is added to the ship stowage planning problem. In order to minimize the operation time and the imbalances of the block operation, a mixed integer programming model for the ship stowage planning problem in ACT is established, which considers the balance of the block operation. At the same time, the conservative parameters of the solution are introduced, and the deterministic model is transformed into a robust optimization. A tabu search algorithm based on numbering and ranking is designed to solve the example. The results prove the correctness of the model and the effectiveness of the algorithm, and the unbalanced block operation volume is 17.8% higher without considering the balance factor than that obtained when considering the balance factor. Under uncertainty, “concentrated stowage” phenomenon is more significant.
Key words: automated container terminals, ship stowage planning, block operation balance, tabu search, robust optimization
摘要:
基于自动化集装箱码头堆场与传统堆场在布局与机械配置方面的区别,将箱区作业均衡因素引入船舶配载问题中,以最小化装船作业时间和箱区作业均衡为目标建立考虑箱区作业均衡的自动化集装箱码头船舶配载混合整数规划模型;同时引入解的保守性参数,将确定性模型转化为考虑桥吊作业时间不确定性的自动化集装箱码头船舶配载鲁棒优化模型,再设计基于编号与排序的禁忌搜索算法对算例进行求解。结果证明了模型的正确性与算法的有效性,且各案例在不考虑箱区作业均衡因素时得到的箱区作业不均衡箱量比考虑该因素时得到的箱区作业不均衡箱量平均高出17.8%,不确定性情况下,“集中配载”现象更加显著。
关键词: 自动化集装箱码头, 船舶配载, 箱区作业均衡, 禁忌搜索, 鲁棒优化
DING Yi, TIAN Liang, GONG Jie. Robust Optimization of Ship Stowage Planning Problem in ACT Considering Balance of Block Operation[J]. Computer Engineering and Applications, 2020, 56(13): 262-272.
丁一,田亮,龚杰. 考虑箱区作业均衡的ACT船舶配载鲁棒优化研究[J]. 计算机工程与应用, 2020, 56(13): 262-272.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1812-0286
http://cea.ceaj.org/EN/Y2020/V56/I13/262