Hybrid Particle Swarm Optimization with parameter selection approaches to solve Flow Shop Scheduling Problem

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

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

Abstract

A Hybrid Particle Swarm Optimization (HPSO) with parameter selection approaches is proposed to solve Flow Shop Scheduling Problem (FSSP) with the objective of minimizing makespan. The HPSO integrates the basic structure of a Particle Swarm Optimization (PSO) together with features borrowed from the fields of Tabu Search (TS), Simulated Annealing (SA). The algorithm works from a population of candidate schedules and generates new populations of neighbor and cooling schedules by applying suitable small perturbation schemes. Furthermore, PSO is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. Another two classes of new adaptive selection of value for inertia weight and acceleration coefficients are introduced into it. 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 some unsolved problems and better solutions in a relatively reasonable time. In addition, proposed algorithms converge to stopping criteria significantly faster.

Original languageEnglish
Title of host publicationProceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011
Pages13-19
Number of pages7
DOIs
Publication statusPublished - Dec 1 2011
Event2011 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011 - London, United Kingdom
Duration: Sep 1 2011Sep 2 2011

Other

Other2011 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011
CountryUnited Kingdom
CityLondon
Period9/1/119/2/11

Fingerprint

Particle swarm optimization (PSO)
Scheduling
Tabu search
Simulated annealing
Cooling
Experiments

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Networks and Communications
  • Human-Computer Interaction

Cite this

Zhang, X. F., An, X., Koshimura, M., Fujita, H., & Hasegawa, R. (2011). Hybrid Particle Swarm Optimization with parameter selection approaches to solve Flow Shop Scheduling Problem. In Proceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011 (pp. 13-19). [6169128] https://doi.org/10.1109/CIS.2011.6169128

Hybrid Particle Swarm Optimization with parameter selection approaches to solve Flow Shop Scheduling Problem. / Zhang, Xue Feng; An, Xuanye; Koshimura, Miyuki; Fujita, Hiroshi; Hasegawa, Ryuzo.

Proceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011. 2011. p. 13-19 6169128.

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

Zhang, XF, An, X, Koshimura, M, Fujita, H & Hasegawa, R 2011, Hybrid Particle Swarm Optimization with parameter selection approaches to solve Flow Shop Scheduling Problem. in Proceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011., 6169128, pp. 13-19, 2011 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011, London, United Kingdom, 9/1/11. https://doi.org/10.1109/CIS.2011.6169128
Zhang XF, An X, Koshimura M, Fujita H, Hasegawa R. Hybrid Particle Swarm Optimization with parameter selection approaches to solve Flow Shop Scheduling Problem. In Proceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011. 2011. p. 13-19. 6169128 https://doi.org/10.1109/CIS.2011.6169128
Zhang, Xue Feng ; An, Xuanye ; Koshimura, Miyuki ; Fujita, Hiroshi ; Hasegawa, Ryuzo. / Hybrid Particle Swarm Optimization with parameter selection approaches to solve Flow Shop Scheduling Problem. Proceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011. 2011. pp. 13-19
@inproceedings{4549ccfc8f2c4530ae2136d5d3aeed7f,
title = "Hybrid Particle Swarm Optimization with parameter selection approaches to solve Flow Shop Scheduling Problem",
abstract = "A Hybrid Particle Swarm Optimization (HPSO) with parameter selection approaches is proposed to solve Flow Shop Scheduling Problem (FSSP) with the objective of minimizing makespan. The HPSO integrates the basic structure of a Particle Swarm Optimization (PSO) together with features borrowed from the fields of Tabu Search (TS), Simulated Annealing (SA). The algorithm works from a population of candidate schedules and generates new populations of neighbor and cooling schedules by applying suitable small perturbation schemes. Furthermore, PSO is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. Another two classes of new adaptive selection of value for inertia weight and acceleration coefficients are introduced into it. 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 some unsolved problems and better solutions in a relatively reasonable time. In addition, proposed algorithms converge to stopping criteria significantly faster.",
author = "Zhang, {Xue Feng} and Xuanye An and Miyuki Koshimura and Hiroshi Fujita and Ryuzo Hasegawa",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/CIS.2011.6169128",
language = "English",
isbn = "9781467306874",
pages = "13--19",
booktitle = "Proceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011",

}

TY - GEN

T1 - Hybrid Particle Swarm Optimization with parameter selection approaches to solve Flow Shop Scheduling Problem

AU - Zhang, Xue Feng

AU - An, Xuanye

AU - Koshimura, Miyuki

AU - Fujita, Hiroshi

AU - Hasegawa, Ryuzo

PY - 2011/12/1

Y1 - 2011/12/1

N2 - A Hybrid Particle Swarm Optimization (HPSO) with parameter selection approaches is proposed to solve Flow Shop Scheduling Problem (FSSP) with the objective of minimizing makespan. The HPSO integrates the basic structure of a Particle Swarm Optimization (PSO) together with features borrowed from the fields of Tabu Search (TS), Simulated Annealing (SA). The algorithm works from a population of candidate schedules and generates new populations of neighbor and cooling schedules by applying suitable small perturbation schemes. Furthermore, PSO is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. Another two classes of new adaptive selection of value for inertia weight and acceleration coefficients are introduced into it. 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 some unsolved problems and better solutions in a relatively reasonable time. In addition, proposed algorithms converge to stopping criteria significantly faster.

AB - A Hybrid Particle Swarm Optimization (HPSO) with parameter selection approaches is proposed to solve Flow Shop Scheduling Problem (FSSP) with the objective of minimizing makespan. The HPSO integrates the basic structure of a Particle Swarm Optimization (PSO) together with features borrowed from the fields of Tabu Search (TS), Simulated Annealing (SA). The algorithm works from a population of candidate schedules and generates new populations of neighbor and cooling schedules by applying suitable small perturbation schemes. Furthermore, PSO is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. Another two classes of new adaptive selection of value for inertia weight and acceleration coefficients are introduced into it. 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 some unsolved problems and better solutions in a relatively reasonable time. In addition, proposed algorithms converge to stopping criteria significantly faster.

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

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

U2 - 10.1109/CIS.2011.6169128

DO - 10.1109/CIS.2011.6169128

M3 - Conference contribution

SN - 9781467306874

SP - 13

EP - 19

BT - Proceedings of 2011, 10th IEEE International Conference on Cybernetic Intelligent Systems, CIS 2011

ER -