求解船体分段堆场调度问题的改进遗传算法  

Improved genetic algorithm for ship block yard scheduling problem

作　　者：李敬花[1] 樊付见[1] 余峰[1] 

机构地区：[1]哈尔滨工程大学船舶工程学院,黑龙江哈尔滨150001

出　　处：《计算机集成制造系统》2012年第12期2674-2682,共9页Computer Integrated Manufacturing Systems

基　　金：工信部高技术船舶科研资助项目(2012317);国家自然科学基金青年科学基金资助项目(51209045);黑龙江省教育厅科学技术研究资助项目(12513056)~~

摘　　要：为有效解决船坞/船台完工分段堆场调度问题,给出了以缩短整船周转周期和提高场地资源利用率为优化目标的时空三维调度问题模型。在有效处理多维约束条件的基础上,设计了求解本问题模型的改进遗传算法,即以分段的吊装计划节点为基准约束,采用分层遗传算法进行优化,并通过不断自适应调整算法在运行时的交叉和变异概率来有效优化种群进化速度,从而改良了算法整体运算性能。通过算例的对比分析,验证了该改进算法的可行性和有效性。To solve the block yard scheduling problem of ship completion, a three-dimensional space-time scheduhng model was proposed with the aim of shortening the turnaround time of shipbuilding and improving the space resource utilization. On the basis of effective dealing with related constraints, an improved genetic algorithm to solve the pro- posed model was designed. In this algorithm, the node of sectional lifting plan was taken as basic constraint to opti- mize the algorithm by using hierarchic genetic algorithm. The speed of population evolution was optimized through crossover and mutation probability of adaptive adjusting algorithm, thus the overall computing performance of the algorithm was improved. The feasibility and effectiveness of proposed algorithm was verified by contrast test of ex- amples.

关 键 词：遗传算法 船体 分段堆场 调度 优化 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]