Researching on Flexible Job-Shop Scheduling Problem based On Composite Grasshopper Optimization Algorithm

Author(s):  
Ding Zhe ◽  
Wu Chunwang ◽  
Zhao Jun ◽  
Binyong Li ◽  
Liangxiao Li ◽  
...  
Mathematics ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 384 ◽  
Author(s):  
Fei Luan ◽  
Zongyan Cai ◽  
Shuqiang Wu ◽  
Tianhua Jiang ◽  
Fukang Li ◽  
...  

In this paper, a novel improved whale optimization algorithm (IWOA), based on the integrated approach, is presented for solving the flexible job shop scheduling problem (FJSP) with the objective of minimizing makespan. First of all, to make the whale optimization algorithm (WOA) adaptive to the FJSP, the conversion method between the whale individual position vector and the scheduling solution is firstly proposed. Secondly, a resultful initialization scheme with certain quality is obtained using chaotic reverse learning (CRL) strategies. Thirdly, a nonlinear convergence factor (NFC) and an adaptive weight (AW) are introduced to balance the abilities of exploitation and exploration of the algorithm. Furthermore, a variable neighborhood search (VNS) operation is performed on the current optimal individual to enhance the accuracy and effectiveness of the local exploration. Experimental results on various benchmark instances show that the proposed IWOA can obtain competitive results compared to the existing algorithms in a short time.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-19
Author(s):  
Yi Feng ◽  
Mengru Liu ◽  
Yuqian Zhang ◽  
Jinglin Wang

Job shop scheduling problem (JSP) is one of the most difficult optimization problems in manufacturing industry, and flexible job shop scheduling problem (FJSP) is an extension of the classical JSP, which further challenges the algorithm performance. In FJSP, a machine should be selected for each process from a given set, which introduces another decision element within the job path, making FJSP be more difficult than traditional JSP. In this paper, a variant of grasshopper optimization algorithm (GOA) named dynamic opposite learning assisted GOA (DOLGOA) is proposed to solve FJSP. The recently proposed dynamic opposite learning (DOL) strategy adopts the asymmetric search space to improve the exploitation ability of the algorithm and increase the possibility of finding the global optimum. Various popular benchmarks from CEC 2014 and FJSP are used to evaluate the performance of DOLGOA. Numerical results with comparisons of other classic algorithms show that DOLGOA gets obvious improvement for solving global optimization problems and is well-performed when solving FJSP.


Sign in / Sign up

Export Citation Format

Share Document