Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
| Autor: | Caroline Gagné, Aymen Sioud |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Mathematical optimization
021103 operations research Information Systems and Management Sequence-dependent setup General Computer Science Job shop scheduling Optimization algorithm Computer science Heuristic 0211 other engineering and technologies 02 engineering and technology Flow shop scheduling Management Science and Operations Research Industrial and Manufacturing Engineering Scheduling (computing) Modeling and Simulation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Algorithm |
| Zdroj: | European Journal of Operational Research. 264:66-73 |
| ISSN: | 0377-2217 |
| Popis: | This paper presents an enhanced migrating bird optimization (MBO) algorithm and a new heuristic for solving a scheduling problem. The proposed approaches are applied to a permutation flowshop with sequence dependent setup times and the objective of minimizing the makespan. In order to augment the MBOs intensification capacity, an original problem specific heuristic is introduced. An adapted neighborhood, a tabu list, a restart mechanism and an original process for selecting a new leader also improved the MBO’s behavior. Using benchmarks from the literature, the resulting enhanced MBO (EMBO) gives state-of-the-art results when compared with other algorithms reference. A statistical analysis of the numerical experiments confirms the relative efficiency and effectiveness of both EMBO and the new heuristic. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect