篇名 |
Fish Migration Optimization with Dynamic Grouping Strategy for Solving Job-Shop Scheduling Problem
|
---|---|
並列篇名 | Fish Migration Optimization with Dynamic Grouping Strategy for Solving Job-Shop Scheduling Problem |
作者 | Qingyong Yang、Shu-Chuan Chu、Chia-Cheng Hu、Jimmy Ming-Tai Wu、Jeng-Shyang Pan |
英文摘要 | Aiming at the job-shop scheduling problem (JSP), a dynamic grouping fish migration optimization (DFMO) is proposed to solve it. The DFMO algorithm adopts a multi-group structure to improve the convergence ability of the algorithm. And the opposition-based learning (OBL) strategy is applied to the group with poor overall fitness value to improve its solving environment. This paper proposes three different communication strategies to exchange information between different groups. In order to better determine the communication time between groups, a dynamic detection method based on population diversity is proposed. Compared with the static method of determining the communication time between groups, the proposed method can make the group more fully explore the current area and more hopefully find the optimal solution. The experiment in this paper is divided into two parts, one part is the numerical experiment test, the other part is the JSP problem standard library test. From the experimental results, the DFMO algorithm can obtain good results in both parts of the experiment, and has a good problem optimization ability.
|
起訖頁 | 1275-1286 |
關鍵詞 | Fish migration optimization、Job-shop scheduling problem、Dynamic grouping strategy、Population diversity、Opposition-based learning |
刊名 | 網際網路技術學刊 |
期數 | 202211 (23:6期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| Multi-Feature Integrated Concurrent Neural Network for Human Facial Expression Recognition |
該期刊 下一篇
| Continuous Leakage-resilient and Hierarchical Identity-based Online/Offline Encryption |