基于混合优化算法的船舶分段堆场间调度研究  

Research on dispatch of blocks between stockyards based on hybrid optimization algorithm

作　　者：李柏鹤 蒋祖华[1,2] 陶宁蓉 孟令通[1,2] LI Baihe;JIANG Zuhua;TAO Ningrong;MENG Lingtong(School of Mechanical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China;Collaborative Innovation Center for Advanced Ship and Deep-Sea Exploration,Shanghai 200240,China;College of Engineering Science and Technology,Shanghai Ocean University,Shanghai 201306,China)

机构地区：[1]上海交通大学机械与动力工程学院,上海200240 [2]高新船舶与深海开发装备协同创新中心,上海200240 [3]上海海洋大学工程学院,上海201306

出　　处：《哈尔滨工程大学学报》2018年第12期2025-2032,共8页Journal of Harbin Engineering University

基　　金：国家自然科学基金项目(71501125)

摘　　要：针对船厂运输任务分段的平板车缺乏有效调度现状,以平板车和任务分段的承重约束、任务优先级约束和任务时间窗约束作为约束条件,建立以平板车空载行驶时间和惩罚时间的权重和作为优化目标的模型。设计遗传算法、禁忌搜索算法,并提出两种构造邻域空间的策略,利用遗传禁忌混合优化算法求解平板车运输分段的最优序列;通过深度优先遍历算法求解考虑转向次数的最优路径,从而实现对模型的求解。以某船厂实际数据为例,对模型的应用进行实例验证,结果表明:本文方法可以求解较优的调度方案,实现资源的高效利用。To realize an effective dispatch scheme of transportation flatcars in shipyards,a model was developed based on the constraints of flatcars load capacity,tasks priority,time window of tasks,and the running time of unloaded flatcars.The penalty weight resulting from the time window constraints was used as a model of the optimization goal.A good feasible solution was obtained by a genetic algorithm,and then Tabu search algorithm was used for constructing two kinds of neighborhood spatial strategy to solve the optimal sequence of the carriage blocks.The depth-first traversal algorithm was used to solve the optimal path considering the number of turns,so as to achieve solution to the model.Finally,the application of the model was verified using the actual data of a shipyard.The results show that the proposed method can solve the optimal scheduling scheme and result in efficient use of resources.

关 键 词：堆场间调度 多类型平板车 任务优先级约束 时间窗约束 遗传算法 禁忌搜索 两种构造邻域空间策略 深度优先搜索 

分 类 号：O224[理学—运筹学与控制论] U673[理学—数学]