基于布谷鸟算法的风电机组装配序列优化

ASSEMBLY SEQUENCE OPTIMIZATION FOR WIND TURBINES BASED ON CUCKOO ALGORITHM

装配序列规划(ASP)是风电机组制造的重要技术。ASP是一个组合优化问题,风电机组最优装配序列的搜索空间和计算量均很大。提出基于布谷鸟算法的风电机组装配序列优化方法。首先,从三维装配体模型中提取多种装配约束信息并表示成装配约束矩阵,以降低最优装配序列的搜索空间;继而构造装配序列目标函数,建立装配序列规划模型,方便算法计算出最优装配序列;对离散布谷鸟算法(DCA)改进,求解ASP模型,获得风电机组产品的最优装配序列。最后通过实验验证了ASP模型的有效性和DCA的优良性能。

Assembly sequence planning(ASP)is one kind of important technology for wind turbine manufacturing.ASP is a combinatorial optimization problem.For wind turbines,the search space as well as the computation of the optimal assembly sequence is huge.To tackle the hard problem,the assembly sequence optimization based on cuckoo algorithm is proposed for wind turbine manufacturing.Firstly,the comprehensive assembly constraints are extracted from the 3D assembly model and represented as four assembly constraint matrices in order to reduce the search space of ASP.Then the assembly sequence objective function is constructed,and the model for assembly sequence planning is established for algorithms to search the optimal assembly sequence.Secondly,the discrete cuckoo algorithm(DCA)is proposed to resolve the ASP model for obtaining the optimal assembly sequence of wind turbines.Finally,the effectiveness of ASP model and excellent performance of DCA are verified by experiments.