A hybrid algorithm based on simplex search and differential evolution for hybrid flow-shop scheduling

An effective hybrid algorithm by merging the searching mechanisms of Nelder-Mead (NM) simplex method and differential evolution (DE) is proposed to solve the hybrid flow-shop problem (HFSP) in this paper. By using a special encoding, the NM and DE methods can be used to solve permutation based combinatorial optimization problems. By combining the DE based… CONTINUE READING