关键词: 遗传算法, 船体, 分段堆场, 调度

Abstract: To solve the block yard scheduling problem of ship completion, a three-dimensional space-time scheduling 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 proposed model was designed. In this algorithm, the node of sectional lifting plan was taken as basic constraint to optimize 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 examples.

Key words: genetic algorithms, ship, block yard, scheduling, optimization