Hybrid scatter search for integer programming problems

The global optimization of integer programming problem is an active research area in many fields. Several versions of scatter search have been proposed to solve different hard optimization problems. The scatter search method is invoked to solve integer programming problems whether it is constrained or not. Therefore, Penalty function is applied in our method to deal with constrained problems and transfer it to unconstrained problems. We implement variable neighbourhood search as intensification and improvement schemes in scatter search procedures to refine generated solutions. The computational results obtained by our proposed method are promising and their performance are tested comparing with other benchmark methods.