4.5 Article

Application of modified multi-objective particle swarm optimisation algorithm for flexible process planning problem

Journal

Publisher

TAYLOR & FRANCIS LTD
DOI: 10.1080/0951192X.2016.1145804

Keywords

flexible process planning; AND; OR network; particle swarm optimisation; genetic algorithms; simulated annealing

Funding

  1. Ministry of Education, Science and Technological Development of the Serbian Government [TR-35004]

Ask authors/readers for more resources

Process planning belongs to one of the most essential functions of the modern manufacturing system. Moreover, flexible process planning implies the ability of a system to adapt to changing requirements and thereby provide alternative ways of performing manufacturing operations on a part. Variety of manufacturing resources including variety of alternative machines, alternative tools, as well as tool access direction (TAD) leads to the fact that most of the parts in modern manufacturing systems have various flexible process plans. Therefore, obtaining optimal process plan from all available alternatives has become a very important task in the domain of flexible process planning research. In this article, a method based on modified particle swarm optimisation (mPSO) has been developed to solve this nondeterministic polynomial-hard combinatorial optimisation problem, and the following issues have been addressed: (i) the AND/OR network representation has been adopted to describe various types of flexibility, i.e. machine flexibility, tool flexibility, TAD flexibility, process flexibility and sequence flexibility; (ii) the particle encoding/decoding scheme has been proposed and traditional PSO algorithm has been modified with crossover, mutation and shift operator and (iii) optimal operation sequence has been found by performing multi-objective optimisation procedure concerning minimisation of the production time and production cost. In order to verify the performance of the proposed mPSO algorithm, five independent experiments have been carried out and comparisons with other meta-heuristic algorithms have been made. The experimental results show that the proposed algorithm has achieved satisfactory improvement in terms of efficiency and effectiveness.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available