A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem
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 populat...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-10-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/11/21/10102 |
| _version_ | 1827678330240892928 |
|---|---|
| author | Jianguo Zheng Yilin Wang |
| author_facet | Jianguo Zheng Yilin Wang |
| author_sort | Jianguo Zheng |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-10T06:06:47Z |
| format | Article |
| id | doaj.art-ad9d0f036e5846beadae23d328d661cf |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-10T06:06:47Z |
| publishDate | 2021-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-ad9d0f036e5846beadae23d328d661cf2023-11-22T20:27:49ZengMDPI AGApplied Sciences2076-34172021-10-0111211010210.3390/app112110102A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling ProblemJianguo Zheng0Yilin Wang1Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, ChinaGlorious Sun School of Business and Management, Donghua University, Shanghai 200051, ChinaIn 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.https://www.mdpi.com/2076-3417/11/21/10102hybrid bat algorithmoptimization problemthe distributed assembly permutation flowshop scheduling problemvariable neighborhood descent |
| spellingShingle | Jianguo Zheng Yilin Wang A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem Applied Sciences hybrid bat algorithm optimization problem the distributed assembly permutation flowshop scheduling problem variable neighborhood descent |
| title | A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem |
| title_full | A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem |
| title_fullStr | A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem |
| title_full_unstemmed | A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem |
| title_short | A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem |
| title_sort | hybrid bat algorithm for solving the three stage distributed assembly permutation flowshop scheduling problem |
| topic | hybrid bat algorithm optimization problem the distributed assembly permutation flowshop scheduling problem variable neighborhood descent |
| url | https://www.mdpi.com/2076-3417/11/21/10102 |
| work_keys_str_mv | AT jianguozheng ahybridbatalgorithmforsolvingthethreestagedistributedassemblypermutationflowshopschedulingproblem AT yilinwang ahybridbatalgorithmforsolvingthethreestagedistributedassemblypermutationflowshopschedulingproblem AT jianguozheng hybridbatalgorithmforsolvingthethreestagedistributedassemblypermutationflowshopschedulingproblem AT yilinwang hybridbatalgorithmforsolvingthethreestagedistributedassemblypermutationflowshopschedulingproblem |