首页 | 本学科首页   官方微博 | 高级检索  
     

不规则型泊位与岸桥集成分配问题的优化建模和算法研究
引用本文:赵姣,胡卉,袁华智. 不规则型泊位与岸桥集成分配问题的优化建模和算法研究[J]. 四川大学学报(自然科学版), 2022, 59(4): 042001-50
作者姓名:赵姣  胡卉  袁华智
作者单位:长安大学运输工程学院,西安710064;兰州理工大学土木工程学院,兰州730050
基金项目:陕西省自然科学基金青年项目(2020JQ-399); 陕西省重点研发计划一般项目(2021GY-184); 兰州理工大学红柳优秀青年人才支持计划项目; 长安大学中央高校基本科研业务费专项资金(300102229304)
摘    要:泊位和岸桥作为港口的有限资源,对其进行优化分配有利于提高港口的作业效率,加快船舶的离港时间.由于地理条件的限制,一些港口的泊位线不呈一条直线型,而是呈“L”或“F”等形状,岸桥无法在这些不连续的泊位线上自由移动,该类泊位无法按照连续型泊位分配问题进行优化,而按照离散泊位进行优化会极大浪费泊位线的空间.本文针对不规则型泊位和岸桥集成分配问题,根据船舶停靠的相对位置和时间建立了线性规划数学模型,结合问题特性和变量关系,提炼出三个有效不等式,并采用CPLEX软件对加入不等式前后的模型分别进行求解.针对问题规模增加后,CPLEX求解时间较长的问题,本文采用了粒子群算法进行求解,并提出具有随机搜索策略的速度更新方式,避免算法陷入局部最优.实验结果表明,加入有效不等式后,模型的求解时间降低了83.39%;改进的粒子群算法比标准粒子群算法获得的优化解降低了25.21%.

关 键 词:不规则型泊位  泊位分配  岸桥分配  集成优化  线性规划  PSO算法
收稿时间:2022-02-19
修稿时间:2022-03-16

Research on optimized modelling and algorithm of integrated allocation of irregular berth and quay crane
ZHAO Jiao,HU Hui and YUAN Hua-Zhi. Research on optimized modelling and algorithm of integrated allocation of irregular berth and quay crane[J]. Journal of Sichuan University (Natural Science Edition), 2022, 59(4): 042001-50
Authors:ZHAO Jiao  HU Hui  YUAN Hua-Zhi
Abstract:As the limited resources of the port, the optimal allocation of berths and quay cranes is conducive to improve the operation efficiency of the port and speed up the departure time of ships. Due to the limitation of geographical conditions, the berth lines of some ports are not linear, but show L or F shape, such as quay cranes can not free to move on these discontinuous berth, this kind of berth allocation problem cannot be optimized based on the continuous berth allocation problem, and the space of the berth line will be wasted based on the discrete berth allocation problem. For the irregular berths and quay crane integrated distribution problem, according to the relative location and time of arrived ships, a mixed linear programming mathematics models is established, three valid inequalities are extracted by analyzing the features and variable relationship, and CPLEX software is used to solve the model. With the increasing of the problem size, the solving time is increasing. Therefore, the improved particle swarm algorithm is proposed, a new velocity updating formula with random search strategy is used to avoid falling into local optimum. The experiment results show that the average solving time is reduced by 83.23% by adding the valid inequalities. The average result obtained by the improved particle swarm algorithm is reduced by 25.21% than that of the standard particle swarm algorithm. It is proved that the improved particle swarm optimization algorithm proposed in this paper is effective in solving the problem of irregular berth and quay crane allocation.
Keywords:
本文献已被 万方数据 等数据库收录!
点击此处可从《四川大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《四川大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号