检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:丁一[1] 张杨 DING Yi;ZHANG Yang(Logistics Research Center,Shanghai Maritime University,Shanghai 201306,China)
出 处:《重庆交通大学学报(自然科学版)》2023年第1期91-98,共8页Journal of Chongqing Jiaotong University(Natural Science)
基 金:国家重点研发计划项目(2019YFB1704400,2019YFB1704405)。
摘 要:为了提高码头配载作业效率,对集装箱码头的场桥调度船舶配载问题进行了研究。结合船舶预配总图、岸桥作业计划和堆场堆存情况,建立了目标为堆场翻箱量最少和场桥箱区间移动时间最短的混合整数规划模型;利用CPLEX对小规模数据模型进行求解,检验了模型的准确性;针对中、大规模问题,设计了一种基于嵌套循环的禁忌搜索算法(NLTS)来寻找解,并与禁忌搜索算法进行对比。研究结果表明:NLTS算法优化效果和运算速度均优于禁忌搜索算法,且优化模型能有效地减少场桥移动时间和翻箱量。In order to improve the efficiency of wharf stowage operation,the problem of ship stowage in yard crane scheduling of container terminals was studied.Considering the ship preconfigured general drawing,quay operation plan and yard storage,a mixed integer programming model was established with the objective of minimizing the number of containers overturned in the yard and the shortest moving time between the bridge boxes in the yard.CPLEX was used to solve the small-scale data model and verify the accuracy of the proposed model.A tabu search algorithm based on nested loop(NLTS)was designed to solve medium and large-scale problems and was compared with the tabu search algorithm.The research results show that the optimization effect and computation speed of NLTS algorithm are better than those of tabu search algorithm,and the optimized model can effectively reduce the moving time of yard crane and the amount of container turnover.
关 键 词:交通运输工程 集装箱码头 船舶配载计划 场桥调度 基于嵌套循环的禁忌搜索算法
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49