关键词: 拆卸序列规划, 花朵授粉算法, 拆卸优先关系, 拆卸作业位置

Abstract: Aiming at the Disassembly Sequence Planning (DSP) problem,a solving method based on Flower Pollination Algorithm (FPA) was proposed.By combining the characteristics of computational intelligence optimization algorithm that was applied in DSP,the pollination method of FPA was discretized with precedence preservative crossover operation of Genetic Algorithm (GA).Based on established Discrete Flower Pollination Algorithm (DFPA),the fitness function model for evaluating DSP quality was constructed.Through the instance,the experimental result of DFPA was analyzed under different initial condition,and the feasibility and effectiveness of proposed algorithm was proved by comparing with GA.

Key words: disassembly sequence planning, flower pollination algorithm, disassembly priority relation, disassembly work position