自动化集装箱码头防台应急箱区整理方法比较  

Comparison of container area arrangement methods of typhoon prevention emergency in automatic container terminals

作　　者：陆志勇 刘慧波 马翠芳 LU Zhiyong;LIU Huibo;MA Cuifang(CCCC Third Harbor Consultants Co.,Ltd.,Shanghai 200032,China)

机构地区：[1]中交第三航务工程勘察设计院有限公司,上海200032

出　　处：《上海海事大学学报》2024年第2期46-52,共7页Journal of Shanghai Maritime University

摘　　要：针对自动化码头在汛期以防台风为目的的箱区整理问题,以最小化总移箱次数为目标,建立箱区整理移箱策略。提出基于优先搜索策略的贪心算法(算法1)和基于优先搜索策略的最长加减箱序列算法(算法2),分别与遗传算法进行对比分析。结果表明:算法2求得的移箱方案中总移箱次数比算法1的减少了12%,比遗传算法的减少了36.9%;算法2的求解速度比算法1的快了61.8%,相较于遗传算法更是有了极大的提高,能够适用于对自动化集装箱码头进行箱区整理的大规模任务。Aimed at the container area arrangement issue of automatic container terminals for typhoon prevention in flood season,with the goal of minimizing the total number of moving containers,a container moving strategy for container area arrangement is established.A greedy algorithm based on priority search strategy(algorithm 1) and an longest addition and subtraction container sequence algorithm based on priority search strategy(algorithm 2) are proposed and compared with genetic algorithm(GA).The results show that the total number of moving container in the container relocation scheme obtained by algorithm 2 decreases by 12% than that of algorithm 1,and 36.9% than that of the GA.The solving speed of algorithm 2 is 61.8% faster than that of algorithm 1,and it is greatly improved compared with the GA.Algorithm 2 can be applied to large-scale tasks of container area arrangement in automatic container terminals.

关 键 词：汛期防台风 移箱 优先搜索策略 最长加减箱序列算法 贪心算法 遗传算法 

分 类 号：U691.31[交通运输工程—港口、海岸及近海工程]