Operation sequencing optimization using a particle swarm optimization approach

Research output: Contribution to journalArticle

67 Citations (Scopus)

Abstract

Operation sequencing is one of the crucial tasks in process planning. However, it is an intractable process to identify an optimized operation sequence with minimal machining cost in a vast search space constrained by manufacturing conditions. In this paper, the complicated operation sequencing process has been modelled as a combinatorial optimization problem, and a modern evolutionary algorithm, i.e. the particle swarm optimization (PSO) algorithm, has been employed and modified to solve it effectively. Initial process plan solutions are formed and encoded into particles of the PSO algorithm. The particles 'fly' intelligently in the search space to achieve the best sequence according to the optimization strategies of the PSO algorithm. Meanwhile, to explore the search space comprehensively and to avoid being trapped into local optima, several new operators have been developed to improve the particles' movements, forming a modified PSO algorithm. A case study involving three prismatic parts has been used to verify the performance and efficiency of the modified PSO algorithm. A comparison has been made between the result of the modified PSO algorithm and the previous results using the genetic algorithm (GA) and the simulated annealing (SA) algorithm and the different characteristics of the three algorithms are indicated. Case studies show that the developed PSO can generate satisfactory results in optimizing the process planning problem. © IMechE 2006.
Original languageEnglish
Pages (from-to)1945-1958
Number of pages14
JournalProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture
Volume220
Issue number12
DOIs
Publication statusPublished - 1 Dec 2006

Fingerprint

Particle swarm optimization (PSO)
Process planning
Combinatorial optimization
Simulated annealing
Evolutionary algorithms
Machining
Genetic algorithms
Costs

Keywords

  • Combinatorial mathematics
  • Process planning
  • Genetic algorithms
  • Simulated annealing

Cite this

@article{0df5a6a431de409088e663d960058ed1,
title = "Operation sequencing optimization using a particle swarm optimization approach",
abstract = "Operation sequencing is one of the crucial tasks in process planning. However, it is an intractable process to identify an optimized operation sequence with minimal machining cost in a vast search space constrained by manufacturing conditions. In this paper, the complicated operation sequencing process has been modelled as a combinatorial optimization problem, and a modern evolutionary algorithm, i.e. the particle swarm optimization (PSO) algorithm, has been employed and modified to solve it effectively. Initial process plan solutions are formed and encoded into particles of the PSO algorithm. The particles 'fly' intelligently in the search space to achieve the best sequence according to the optimization strategies of the PSO algorithm. Meanwhile, to explore the search space comprehensively and to avoid being trapped into local optima, several new operators have been developed to improve the particles' movements, forming a modified PSO algorithm. A case study involving three prismatic parts has been used to verify the performance and efficiency of the modified PSO algorithm. A comparison has been made between the result of the modified PSO algorithm and the previous results using the genetic algorithm (GA) and the simulated annealing (SA) algorithm and the different characteristics of the three algorithms are indicated. Case studies show that the developed PSO can generate satisfactory results in optimizing the process planning problem. {\circledC} IMechE 2006.",
keywords = "Combinatorial mathematics, Process planning, Genetic algorithms, Simulated annealing",
author = "Guo, {Y W} and Mileham, {Anthony R} and Owen, {Geraint W} and Li, {W D}",
year = "2006",
month = "12",
day = "1",
doi = "10.1243/09544054JEM647",
language = "English",
volume = "220",
pages = "1945--1958",
journal = "Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture",
issn = "0954-4054",
publisher = "Sage Publications",
number = "12",

}

TY - JOUR

T1 - Operation sequencing optimization using a particle swarm optimization approach

AU - Guo, Y W

AU - Mileham, Anthony R

AU - Owen, Geraint W

AU - Li, W D

PY - 2006/12/1

Y1 - 2006/12/1

N2 - Operation sequencing is one of the crucial tasks in process planning. However, it is an intractable process to identify an optimized operation sequence with minimal machining cost in a vast search space constrained by manufacturing conditions. In this paper, the complicated operation sequencing process has been modelled as a combinatorial optimization problem, and a modern evolutionary algorithm, i.e. the particle swarm optimization (PSO) algorithm, has been employed and modified to solve it effectively. Initial process plan solutions are formed and encoded into particles of the PSO algorithm. The particles 'fly' intelligently in the search space to achieve the best sequence according to the optimization strategies of the PSO algorithm. Meanwhile, to explore the search space comprehensively and to avoid being trapped into local optima, several new operators have been developed to improve the particles' movements, forming a modified PSO algorithm. A case study involving three prismatic parts has been used to verify the performance and efficiency of the modified PSO algorithm. A comparison has been made between the result of the modified PSO algorithm and the previous results using the genetic algorithm (GA) and the simulated annealing (SA) algorithm and the different characteristics of the three algorithms are indicated. Case studies show that the developed PSO can generate satisfactory results in optimizing the process planning problem. © IMechE 2006.

AB - Operation sequencing is one of the crucial tasks in process planning. However, it is an intractable process to identify an optimized operation sequence with minimal machining cost in a vast search space constrained by manufacturing conditions. In this paper, the complicated operation sequencing process has been modelled as a combinatorial optimization problem, and a modern evolutionary algorithm, i.e. the particle swarm optimization (PSO) algorithm, has been employed and modified to solve it effectively. Initial process plan solutions are formed and encoded into particles of the PSO algorithm. The particles 'fly' intelligently in the search space to achieve the best sequence according to the optimization strategies of the PSO algorithm. Meanwhile, to explore the search space comprehensively and to avoid being trapped into local optima, several new operators have been developed to improve the particles' movements, forming a modified PSO algorithm. A case study involving three prismatic parts has been used to verify the performance and efficiency of the modified PSO algorithm. A comparison has been made between the result of the modified PSO algorithm and the previous results using the genetic algorithm (GA) and the simulated annealing (SA) algorithm and the different characteristics of the three algorithms are indicated. Case studies show that the developed PSO can generate satisfactory results in optimizing the process planning problem. © IMechE 2006.

KW - Combinatorial mathematics

KW - Process planning

KW - Genetic algorithms

KW - Simulated annealing

UR - http://dx.doi.org/10.1243/09544054JEM647

U2 - 10.1243/09544054JEM647

DO - 10.1243/09544054JEM647

M3 - Article

VL - 220

SP - 1945

EP - 1958

JO - Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture

JF - Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture

SN - 0954-4054

IS - 12

ER -