A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine

The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.

Fuzzy Hybrid Coyote Optimization Algorithm for Image Thresholding

In order to address the problems of Coyote Optimization Algorithm in image thresholding,such as easily falling into local optimum,and slow convergence speed,a Fuzzy Hybrid Coyote Optimization Algorithm(here-inafter referred to as FHCOA)based on chaotic initialization and reverse learning strategy is proposed,and its effect on image thresholding is verified.Through chaotic initialization,the random number initialization mode in the standard coyote optimization algorithm(COA)is replaced by chaotic sequence.Such sequence is nonlinear and long-term unpredictable,these characteristics can effectively improve the diversity of the population in the optimization algorithm.Therefore,in this paper we first perform chaotic initialization,using chaotic sequence to replace random number initialization in standard COA.By combining the lens imaging reverse learning strategy and the optimal worst reverse learning strategy,a hybrid reverse learning strategy is then formed.In the process of algorithm traversal,the best coyote and the worst coyote in the pack are selected for reverse learning operation respectively,which prevents the algorithm falling into local optimum to a certain extent and also solves the problem of premature convergence.Based on the above improvements,the coyote optimization algorithm has better global convergence and computational robustness.The simulation results show that the algorithmhas better thresholding effect than the five commonly used optimization algorithms in image thresholding when multiple images are selected and different threshold numbers are set.