Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem
| Autor: | Patrick Siarry, Bassem Jarboui, Mansour Eddaly |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization Optimization problem Iterated local search 0211 other engineering and technologies Computational Mechanics Initialization 02 engineering and technology 020901 industrial engineering & automation lcsh:TA174 Blocking flowshop Multi-swarm optimization Engineering (miscellaneous) Metaheuristic Mathematics Makespan 021103 operations research Job shop scheduling Scheduling Particle swarm optimization Probabilistic logic lcsh:Engineering design Computer Graphics and Computer-Aided Design Human-Computer Interaction Computational Mathematics Modeling and Simulation |
| Zdroj: | Journal of Computational Design and Engineering, Vol 3, Iss 4, Pp 295-311 (2016) |
| ISSN: | 2288-4300 |
| DOI: | 10.1016/j.jcde.2016.05.001 |
| Popis: | This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem. Highlights The blocking flowshop scheduling problem is very attractive problem in engineering. A particle swarm optimization approach is proposed. Extensive experiments are conducted to choose the initialization way. Improvement procedure is introduced based on iterated local search algorithm. A real-world case is solved by the proposed algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|