Back to Search
Start Over
A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem.
- Source :
- Applied Sciences (2076-3417); Nov2021, Vol. 11 Issue 21, p10102, 26p
- Publication Year :
- 2021
-
Abstract
- In this paper, a hybrid bat optimization algorithm based on variable neighbourhood structure and two learning strategies is proposed to solve a three-stage distributed assembly permutation flowshop scheduling problem to minimize the makespan. The algorithm is firstly designed to increase the population diversity by classifying the populations, which solves the difficult trade-off between convergence and diversity of the bat algorithm. Secondly, a selection mechanism is used to update the bat's velocity and location, solving the difficulty of the algorithm to trade-off exploration and mining capacity. Finally, the Gaussian learning strategy and elite learning strategy assist the whole population to jump out of the local optimal frontier. The simulation results demonstrate that the algorithm proposed in this paper can well solve the DAPFSP. In addition, compared with other metaheuristic algorithms, IHBA has better performance and gives full play to its advantage of finding optimal solutions. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 20763417
- Volume :
- 11
- Issue :
- 21
- Database :
- Complementary Index
- Journal :
- Applied Sciences (2076-3417)
- Publication Type :
- Academic Journal
- Accession number :
- 153603553
- Full Text :
- https://doi.org/10.3390/app112110102