Search

This paper proposes a modified discrete firefly algorithm (MDFA) to solve the problem of assembly sequence planning. Firstly, to improve the performance of the firefly algorithm (FA), we proposed a MDFA by endowing the fireflies with the capability of changeable visual range. The computing case shows the proposed algorithm is more effective and robust than standard FA, genetic algorithm and particle swarm optimization algorithm. Secondly, a method of how to set parameters for FA and MDFA is proposed. This method is practical in the application of FA to solve discrete problem. Thirdly, to make the sequences more closer to real industrial requirements, a so called process precedence relations (PPR) evaluation function is presented, which not only considering the interference between parts, assembly tools and clamps, but also regarding the assembly order between parts and their reference parts. Finally, the evolution performance of the MDFA is investigated, and the performance of the proposed approach to solve ASP is verified through two cases study. [ABSTRACT FROM AUTHOR]