检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨勇生[1] 冯有勇 梁承姬[1] 许波桅[1] 李军军[2]
机构地区:[1]上海海事大学物流科学与工程研究院商船学院,上海201306 [2]上海海事大学商船学院,上海201306
出 处:《上海海事大学学报》2017年第2期1-6,共6页Journal of Shanghai Maritime University
基 金:国家自然科学基金(61540045);教育部人文社会科学研究项目(15YJC630145,15YJC630059);上海市自然科学基金(15ZR1420200);上海市科学技术委员会科技创新行动计划(14170501500,16DZ2340400,16DZ2349900,14DZ2280200);上海市人才发展基金(201518)
摘 要:为解决自动导引小车(Automated Guided Vehicle,AGV)与轨道式龙门起重机(Rail-Mounted Gantry Crane,RMG)的协同调度问题,考虑AGV和RMG的任务分配约束,以卸船作业最小完工时间为目标,建立混合整数规划(Mixed Integer Programming,MIP)模型.改变AGV,岸桥和箱区数量的配置,得出不同条件下的完工时间.对该问题设计两组算例:小规模算例采用CPLEX软件和遗传算法(Genetic Algorithm,GA)分别进行求解,通过结果对比验证GA的有效性;大规模算例采用GA求解,给出自动化码头设备调度优化方案.分析结果表明,卸船完工时间随着卸船任务量的增加而增加,随着AGV,岸桥和箱区数量的增加而减少,且AGV和岸桥数量的增加对完工时间的影响大于箱区数量的增加时完工数量的影响.For the integrated scheduling issue of Automated Guided Vehicles( AGVs) and Rail-Mounted Gantry Cranes( RMGs),a Mixed Integer Programming( MIP) model is proposed so as to minimize the makespan of unloading operation with task allocation constraints of AGVs and RMGs. Changing the numbers of AGVs,quay cranes and blocks,the makespans under different conditions are obtained. Two groups of examples are performed. The small-sized examples are solved by CPLEX software and Genetic Algorithm( GA) respectively,and the validity of GA is verified by comparing the results. The large-sized examples are solved only using GA,and the equipment scheduling scheme at an automated container terminal is given. The results show that the makespan increases with the increase of unloading task,and de-creases with the increase of the numbers of AGVs,quay cranes and blocks,where the effects of the increase of the numbers of AGVs and quay cranes on the makespan are greater than that of the increase of the number of blocks.
关 键 词:自动导引小车(AGV) 堆场箱区 协同调度 混合整数规划(MIP) 遗传算法(GA)
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222