OPTIMAL SEQUENCE OF HOLE-MAKING OPERATIONS USING PARTICLE SWARM OPTIMISATION AND SHUFFLED FROG LEAPING ALGORITHM

Abstract

Tool travel and tool switch scheduling are two major issues in hole-making operations. It is necessary to find the optimal sequence of operations to reduce the total processing cost of hole-making operations. In this work therefore, an attempt is made to use both a recently developed particle swarm optimisation algorithm and a shuffled frog leaping algorithm demonstrating in this way an example of plastic injection mould. The exact value of the minimum total processing cost is obtained by considering all possible combinations of sequences. The results obtained using particle swarm optimisation and shuffled frog leaping algorithm are compared with the minimum total processing cost results obtained by considering all possible combinations of sequences. It is observed that the results obtained using particle swarm optimisation and shuffled frog leaping algorithm are closer to the results of the minimum total processing cost obtained by considering all possible combinations of sequences presented in this work. This clearly shows that particle swarm optimisation and shuffled frog leaping algorithm can be effectively used in optimisation of large scale injection mould hole-making operations