A discrete particle swarm optimisation for operation sequencing in CAPP. Issue 11 (3rd June 2018)

• Record Type: Journal Article
• Authors: Dou, Jianping; Li, Jun; Su, Chun
• Is Part Of: International journal of production research. Volume 56:Issue 11(2018)
• Page Start: 3795
• Page End: 3814
• Publication Date: 2018-06-03
• Subjects: operation sequencing -- discrete particle swarm optimisation -- feasible operation sequences -- adaptive mutation -- Taguchi method; Factory management -- Periodicals; 658.57
• DOI: 10.1080/00207543.2018.1425015
• Languages: English
• ISSNs: 0020-7543

Abstract

Abstract : Operation sequencing is one of crucial tasks for process planning in a CAPP system. In this study, a novel discrete particle swarm optimisation (DPSO) named feasible sequence oriented DPSO (FSDPSO) is proposed to solve the operation sequencing problems in CAPP. To identify the process plan with lowest machining cost efficiently, the FSDPSO only searches the feasible operation sequences (FOSs) satisfying precedence constraints. In the FSDPSO, a particle represents a FOS as a permutation directly and the crossover-based updating mechanism is developed to evolve the particles in discrete feasible solution space. Furthermore, the fragment mutation for altering FOS and the uniform and greedy mutations for changing machine, cutting tool and tool access direction for each operation, along with the adaptive mutation probability, are adopted to improve exploration ability. Case studies are used to verify the performance of the FSDPSO. For case studies, the Taguchi method is used to determine the key parameters of the FSDPSO. A comparison has been made between the result of the proposed FSDPSO and those of three existing PSOs, an existing genetic algorithm and two ant colony algorithms. The comparative results show higher performance of the FSDPSO with respect to solution quality for operation sequencing.