Memetic algorithm for assembly sequence planning

The paper presents the application of a memetic algorithm to searching for the optimal sequence of the assembly of parts. Such approach is based on the use of an algorithm connecting two methods of global and local search in order to increase the effectiveness of the conducted optimisation process. Based on a proper representation of assembly sequences and a set of geometrical, topological and technological constraints, connected with the attributes of a product, it is possible to create an evolutionary model. Through proper control of the evolution process in a model, based on the appropriate selection of parameters, it is possible to achieve good results in a short period of time. Although the evolutionary algorithm does not guarantee the obtaining of optimal solutions, it has been proven, based on sample simulations, that such solutions are obtained in a repeated manner. The application of the presented evolutionary approach enables creating fast assembly sequence planning tools, indispensable in tactical planning and operational control of manufacturing processes.