Hybrid Self Organising Migrating - Scatter Search Algorithm

Abstract

A hybrid approach combining the unique exploration strategy of Discreet Self Organising Migration Algorithm and the robust and effective memory adaptive programming paradigm of Scatter Search is presented. The new hybrid approach is developed to solve permutative combinatorial optimization problems and it applied to the flow-shop with no-wait scheduling optimization problem. Experimentation is done with the benchmark Taillard sets and the obtained results are favorably compared with results in current literature. © Springer-Verlag Berlin Heidelberg 2013.