Hybrid bat algorithm for flow shop scheduling problems (Q2204236)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7261359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid bat algorithm for flow shop scheduling problems |
scientific article; zbMATH DE number 7261359 |
Statements
Hybrid bat algorithm for flow shop scheduling problems (English)
0 references
15 October 2020
0 references
Summary: In this paper, a hybrid bat algorithm is proposed to solve the permutation flow shop scheduling problems with makespan criterion. Developed for numerical optimisation, local search techniques are integrated into the bat algorithm to solve the flow shop problems. Reeves test problems from the literature are used to compare the performance of the proposed algorithm against the best known solutions, NEH and with different metaheuristics. Computational results and statistical analysis indicate that the proposed algorithm can be more efficient than many other metaheuristic algorithms addressed in the literature.
0 references
flowshop scheduling
0 references
makespan
0 references
bat algorithm
0 references
metaheuristics
0 references
local search
0 references
0.8450265526771545
0 references
0.822580099105835
0 references
0.8139019012451172
0 references
0.810114324092865
0 references
0.791071355342865
0 references
