检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张帝 梅子翘 陈峰 赵一飞 ZHANG Di;MEI Zi-qiao;CHEN Feng;ZHAO Yi-fei(School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China;Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200030, China;Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai 200030, China)
机构地区:[1]上海交通大学机械与动力工程学院,上海200240 [2]上海交通大学安泰经济与管理学院,上海200030 [3]上海交通大学中美物流研究院,上海200030
出 处:《运筹与管理》2022年第3期9-16,共8页Operations Research and Management Science
基 金:国家自然科学基金资助项目(71672115)。
摘 要:本文研究滚装码头混合泊位分配和劳动力分配的联合调度优化问题。首先,考虑潮汐时间窗约束、装卸劳动力约束、泊位缆桩分布约束以及泊位不规则布局因素,建立以最小化船舶总服务时间为目标的混合整数规划模型。其次,采用内外嵌套算法设计策略,提出求解该类问题的组合算法。其中,外层是多种群并行进化的遗传算法,生成多种船舶计划顺序,内层为基于规则的启发式算法,用于计算给定计划顺序的目标函数值。然后,基于实际运营数据,生成多组不同规模的算例进行全面数值实验,结果表明所提出的算法可在10分钟内求解包含50艘船、100个泊段的算例。最后,开展基于真实滚装码头运营实例的案例分析,对所提模型和算法在实际码头调度问题中的适用性与高效性进行验证。This paper studies anunprece dented joint scheduling problem of mixed berth allocation and manpower assignment in RO-RO terminals.Firstly,a mixed integer programming model is established with the objective of minimizing the total servicing time of vessels,which considers tidal time window constraints,handling manpower constraints,berth bollards distribution constraints,and irregular berth layout factors.Then,a combinational algorithm is proposed by adopting an interactive strategy,which contains a multi-group parallel evolutionary genetic algorithm that generates plan sequences and a rule-based heuristic algorithm that obtains individual fitness values for given sequences.Furthermore,based on the real operation data,several sets of numerical experiments are generated and the results show that the genetic algorithm can solve an example which contains 50 vessels and 100 berth sections within 10 minutes.Finally,real RO-RO terminal operation cases are carried out to verify the applicability and efficiency of the proposed model and algorithm in the actual scheduling problem.
关 键 词:汽车物流 滚装码头 优化模型 遗传算法 启发式算法
分 类 号:U6913[交通运输工程—港口、海岸及近海工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33