基于遗传算法的平板车调度优化方法  

Flat-car scheduling optimization method based on genetic algorithm

作　　者：孟令通 朱洪渊 蒋祖华[1] 刘建峰 MENG Lingtong;ZHU Hongyuan;JIANG Zuhua;LIU Jianfeng(School of Mechanical & Power Engineering, Shanghai Jiaotong University, Shanghai 200240, China;Shanghai Waigaoqiao Shipbuilding Co. Ltd., Shanghai 200137, China)

机构地区：[1]上海交通大学机械与动力工程学院,上海200240 [2]上海外高桥造船有限公司,上海200137

出　　处：《哈尔滨工程大学学报》2018年第3期554-560,共7页Journal of Harbin Engineering University

基　　金：国家自然科学基金项目(71501125);工业和信息化部项目(工信部联装[2014]507号-5)

摘　　要：为了解决船厂的分段运输计划主要依靠调度员经验进行,决策时间长,常有运输任务冲突和道路重复占用的问题,将平板车的运输作为研究对象,以平板车最小空载时间为优化目标,在保证任务执行准时性的前提下,构建了考虑平板车数量、运输能力、堆场内部分段运输任务之间先后约束关系等因素的平板车运输调度遗传算法模型,得到优化后的任务序列并确定平板车的任务执行顺序。利用某船厂的实际数据对模型的应用进行了实例验证,结果表明:该模型可得出较优的平板车调度任务计划,减少空载时间,提高平板车的运输效率。The present plan of the fragmented transport in a shipyard mainly depends on the dispatcher′s experience.Moreover,the decision-making time is long;the transport tasks are often in conflict;and the road is repeatedly occupied.The flat-car transport is chosen as the research object herein to eliminate such defects.Under the premise of assuring a timely task execution,a model of the genetic algorithm for the flat-car transport scheduling considering various factors(i.e.,flat-car quantity,carrying capacity,and task precedence constraint relations among the fragmented transport tasks in the stacking yard)is established by taking the minimum idling time of a flat car as the optimization objective.The task sequence is optimized,and the task execution sequence of the flat car is determined.The actual data of a shipyard is applied for the case verification of the model application.The results show that the model could obtain a better flat-car scheduling plan,reduce the idling time,and improve the flat-car efficiency.

关 键 词：平板车 任务序列 空载时间 调度模型 遗传算法 调度计划 

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