Applications of particle swarm optimisation in integrated process planning and scheduling

Y W Guo, W D Liu, Antony R Mileham, Geraint W Owen

Research output: Contribution to journalArticle

137 Citations (Scopus)

Abstract

Integration of process planning and scheduling (IPPS) is an important research issue to achieve manufacturing planning optimisation. In both process planning and scheduling, vast search spaces and complex technical constraints are significant barriers to the effectiveness of the processes. In this paper, the IPPS problem has been developed as a combinatorial optimisation model, and a modern evolutionary algorithm, i.e., the particle swarm optimisation (PSO) algorithm, has been modified and applied to solve it effectively. Initial 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 optimisation 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 to form a modified PSO algorithm. Case studies have been conducted 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 generated by the genetic algorithm (GA) and the simulated annealing (SA) algorithm, respectively, and the different characteristics of the three algorithms are indicated. Case Studies show that the developed PSO can generate satisfactory results in both applications.
Original languageEnglish
Pages (from-to)280-288
Number of pages9
JournalRobotics and Computer-Integrated Manufacturing
Volume25
Issue number2
DOIs
Publication statusPublished - 2009

Fingerprint

Planning and Scheduling
Integrated Process
Process Planning
Process planning
Particle Swarm Optimization Algorithm
Particle swarm optimization (PSO)
Particle Swarm Optimization
Scheduling
Search Space
Optimization
Simulated Annealing Algorithm
Combinatorial Optimization
Optimization Model
Evolutionary Algorithms
Scheduling Problem
Combinatorial optimization
Manufacturing
Simulated annealing
Planning
Genetic Algorithm

Keywords

  • planning and scheduling
  • Integrated process
  • Genetic algorithm
  • Operation sequencing
  • Particle swarm optimisation
  • Simulated annealing

Cite this

@article{2fbd574ac5ea4e89b92df65fbc7a41e3,
title = "Applications of particle swarm optimisation in integrated process planning and scheduling",
abstract = "Integration of process planning and scheduling (IPPS) is an important research issue to achieve manufacturing planning optimisation. In both process planning and scheduling, vast search spaces and complex technical constraints are significant barriers to the effectiveness of the processes. In this paper, the IPPS problem has been developed as a combinatorial optimisation model, and a modern evolutionary algorithm, i.e., the particle swarm optimisation (PSO) algorithm, has been modified and applied to solve it effectively. Initial 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 optimisation 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 to form a modified PSO algorithm. Case studies have been conducted 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 generated by the genetic algorithm (GA) and the simulated annealing (SA) algorithm, respectively, and the different characteristics of the three algorithms are indicated. Case Studies show that the developed PSO can generate satisfactory results in both applications.",
keywords = "planning and scheduling, Integrated process, Genetic algorithm, Operation sequencing, Particle swarm optimisation, Simulated annealing",
author = "Guo, {Y W} and Liu, {W D} and Mileham, {Antony R} and Owen, {Geraint W}",
year = "2009",
doi = "10.1016/j.rcim.2007.12.002",
language = "English",
volume = "25",
pages = "280--288",
journal = "Robotics and Computer-Integrated Manufacturing",
issn = "0736-5845",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Applications of particle swarm optimisation in integrated process planning and scheduling

AU - Guo, Y W

AU - Liu, W D

AU - Mileham, Antony R

AU - Owen, Geraint W

PY - 2009

Y1 - 2009

N2 - Integration of process planning and scheduling (IPPS) is an important research issue to achieve manufacturing planning optimisation. In both process planning and scheduling, vast search spaces and complex technical constraints are significant barriers to the effectiveness of the processes. In this paper, the IPPS problem has been developed as a combinatorial optimisation model, and a modern evolutionary algorithm, i.e., the particle swarm optimisation (PSO) algorithm, has been modified and applied to solve it effectively. Initial 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 optimisation 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 to form a modified PSO algorithm. Case studies have been conducted 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 generated by the genetic algorithm (GA) and the simulated annealing (SA) algorithm, respectively, and the different characteristics of the three algorithms are indicated. Case Studies show that the developed PSO can generate satisfactory results in both applications.

AB - Integration of process planning and scheduling (IPPS) is an important research issue to achieve manufacturing planning optimisation. In both process planning and scheduling, vast search spaces and complex technical constraints are significant barriers to the effectiveness of the processes. In this paper, the IPPS problem has been developed as a combinatorial optimisation model, and a modern evolutionary algorithm, i.e., the particle swarm optimisation (PSO) algorithm, has been modified and applied to solve it effectively. Initial 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 optimisation 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 to form a modified PSO algorithm. Case studies have been conducted 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 generated by the genetic algorithm (GA) and the simulated annealing (SA) algorithm, respectively, and the different characteristics of the three algorithms are indicated. Case Studies show that the developed PSO can generate satisfactory results in both applications.

KW - planning and scheduling

KW - Integrated process

KW - Genetic algorithm

KW - Operation sequencing

KW - Particle swarm optimisation

KW - Simulated annealing

UR - http://www.scopus.com/inward/record.url?scp=64149102872&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1016/j.rcim.2007.12.002

U2 - 10.1016/j.rcim.2007.12.002

DO - 10.1016/j.rcim.2007.12.002

M3 - Article

VL - 25

SP - 280

EP - 288

JO - Robotics and Computer-Integrated Manufacturing

JF - Robotics and Computer-Integrated Manufacturing

SN - 0736-5845

IS - 2

ER -