Combining PSO and local search to solve scheduling problems

Xue Feng Zhang, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Intelligent manufacturing is associated with a large number of complex optimization problems and for this reason has got a considerable research attention over the last decades. Most of these problems are of combinatorial nature and have been proved to be NP-complete. This paper deals with the flow shop scheduling problem (FSSP) and the Job Shop Scheduling Problem (JSSP). The objective of these problems is to find an appropriate sequence to minimize the makespan, which are defined as the time for completing a final operation. One major challenging issue is how to obtain the high-quality global optimum. In order to refrain from the premature convergence and being easily trapped into local optimum, we are motivated to find high-quality solutions in a reasonable computation time by exploiting Particle Swarm Optimization (PSO), Tabu Search (TS) and Simulated Annealing (SA). We propose a new multi-structural hybrid evolutionary framework, and derive HPTS algorithm as its extension. Extensive experiments on different scale benchmarks validate the effectiveness of our approaches, compared with other well-established methods. The experimental results show that new upper bounds of the unsolved problems are achieved in a relatively reasonable time. For example, in 30 Tailland's and 43 OR-Library benchmarks, 7 new upper bounds and 6 new upper bounds are obtained by the HPTS algorithm, respectively.

Original languageEnglish
Title of host publicationGenetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication
Pages347-354
Number of pages8
DOIs
Publication statusPublished - Aug 26 2011
Event13th Annual Genetic and Evolutionary Computation Conference, GECCO'11 - Dublin, Ireland
Duration: Jul 12 2011Jul 16 2011

Publication series

NameGenetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication

Other

Other13th Annual Genetic and Evolutionary Computation Conference, GECCO'11
CountryIreland
CityDublin
Period7/12/117/16/11

Fingerprint

Particle swarm optimization (PSO)
Local Search
Particle Swarm Optimization
Scheduling Problem
Scheduling
Upper bound
Tabu search
Simulated annealing
Benchmark
Job Shop Scheduling Problem
Premature Convergence
Flow Shop Scheduling
Global Optimum
Tabu Search
Simulated Annealing
NP-complete problem
Manufacturing
Optimization Problem
Minimise
Experiments

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Zhang, X. F., Koshimura, M., Fujita, H., & Hasegawa, R. (2011). Combining PSO and local search to solve scheduling problems. In Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication (pp. 347-354). (Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication). https://doi.org/10.1145/2001858.2002017

Combining PSO and local search to solve scheduling problems. / Zhang, Xue Feng; Koshimura, Miyuki; Fujita, Hiroshi; Hasegawa, Ryuzo.

Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication. 2011. p. 347-354 (Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, XF, Koshimura, M, Fujita, H & Hasegawa, R 2011, Combining PSO and local search to solve scheduling problems. in Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication. Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication, pp. 347-354, 13th Annual Genetic and Evolutionary Computation Conference, GECCO'11, Dublin, Ireland, 7/12/11. https://doi.org/10.1145/2001858.2002017
Zhang XF, Koshimura M, Fujita H, Hasegawa R. Combining PSO and local search to solve scheduling problems. In Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication. 2011. p. 347-354. (Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication). https://doi.org/10.1145/2001858.2002017
Zhang, Xue Feng ; Koshimura, Miyuki ; Fujita, Hiroshi ; Hasegawa, Ryuzo. / Combining PSO and local search to solve scheduling problems. Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication. 2011. pp. 347-354 (Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication).
@inproceedings{f633605a07ff43df87893e5f85f846a5,
title = "Combining PSO and local search to solve scheduling problems",
abstract = "Intelligent manufacturing is associated with a large number of complex optimization problems and for this reason has got a considerable research attention over the last decades. Most of these problems are of combinatorial nature and have been proved to be NP-complete. This paper deals with the flow shop scheduling problem (FSSP) and the Job Shop Scheduling Problem (JSSP). The objective of these problems is to find an appropriate sequence to minimize the makespan, which are defined as the time for completing a final operation. One major challenging issue is how to obtain the high-quality global optimum. In order to refrain from the premature convergence and being easily trapped into local optimum, we are motivated to find high-quality solutions in a reasonable computation time by exploiting Particle Swarm Optimization (PSO), Tabu Search (TS) and Simulated Annealing (SA). We propose a new multi-structural hybrid evolutionary framework, and derive HPTS algorithm as its extension. Extensive experiments on different scale benchmarks validate the effectiveness of our approaches, compared with other well-established methods. The experimental results show that new upper bounds of the unsolved problems are achieved in a relatively reasonable time. For example, in 30 Tailland's and 43 OR-Library benchmarks, 7 new upper bounds and 6 new upper bounds are obtained by the HPTS algorithm, respectively.",
author = "Zhang, {Xue Feng} and Miyuki Koshimura and Hiroshi Fujita and Ryuzo Hasegawa",
year = "2011",
month = "8",
day = "26",
doi = "10.1145/2001858.2002017",
language = "English",
isbn = "9781450306904",
series = "Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication",
pages = "347--354",
booktitle = "Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication",

}

TY - GEN

T1 - Combining PSO and local search to solve scheduling problems

AU - Zhang, Xue Feng

AU - Koshimura, Miyuki

AU - Fujita, Hiroshi

AU - Hasegawa, Ryuzo

PY - 2011/8/26

Y1 - 2011/8/26

N2 - Intelligent manufacturing is associated with a large number of complex optimization problems and for this reason has got a considerable research attention over the last decades. Most of these problems are of combinatorial nature and have been proved to be NP-complete. This paper deals with the flow shop scheduling problem (FSSP) and the Job Shop Scheduling Problem (JSSP). The objective of these problems is to find an appropriate sequence to minimize the makespan, which are defined as the time for completing a final operation. One major challenging issue is how to obtain the high-quality global optimum. In order to refrain from the premature convergence and being easily trapped into local optimum, we are motivated to find high-quality solutions in a reasonable computation time by exploiting Particle Swarm Optimization (PSO), Tabu Search (TS) and Simulated Annealing (SA). We propose a new multi-structural hybrid evolutionary framework, and derive HPTS algorithm as its extension. Extensive experiments on different scale benchmarks validate the effectiveness of our approaches, compared with other well-established methods. The experimental results show that new upper bounds of the unsolved problems are achieved in a relatively reasonable time. For example, in 30 Tailland's and 43 OR-Library benchmarks, 7 new upper bounds and 6 new upper bounds are obtained by the HPTS algorithm, respectively.

AB - Intelligent manufacturing is associated with a large number of complex optimization problems and for this reason has got a considerable research attention over the last decades. Most of these problems are of combinatorial nature and have been proved to be NP-complete. This paper deals with the flow shop scheduling problem (FSSP) and the Job Shop Scheduling Problem (JSSP). The objective of these problems is to find an appropriate sequence to minimize the makespan, which are defined as the time for completing a final operation. One major challenging issue is how to obtain the high-quality global optimum. In order to refrain from the premature convergence and being easily trapped into local optimum, we are motivated to find high-quality solutions in a reasonable computation time by exploiting Particle Swarm Optimization (PSO), Tabu Search (TS) and Simulated Annealing (SA). We propose a new multi-structural hybrid evolutionary framework, and derive HPTS algorithm as its extension. Extensive experiments on different scale benchmarks validate the effectiveness of our approaches, compared with other well-established methods. The experimental results show that new upper bounds of the unsolved problems are achieved in a relatively reasonable time. For example, in 30 Tailland's and 43 OR-Library benchmarks, 7 new upper bounds and 6 new upper bounds are obtained by the HPTS algorithm, respectively.

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

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

U2 - 10.1145/2001858.2002017

DO - 10.1145/2001858.2002017

M3 - Conference contribution

AN - SCOPUS:80051925910

SN - 9781450306904

T3 - Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication

SP - 347

EP - 354

BT - Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication

ER -