Using tabu search algorithm for nonlinear global optimization problems

Abstract

Although tabu search algorithms have been used for combinatorial problems such as assignment, scheduling, shortest path, and travelling salesman problem often, they have been used for continous global optimization problems rarely. In this study, the optimization of a nonlinear function problem is solved by using tabu search algorithm. The algorithm, which is developed in this study, is tested in a minimization problem having seven variables and it forms an example that shows how to use tabu search algorithm for such problems with geting rational results. Because of a large number of tabu structures which are explained ahead, just the first and the fifth tabu structures are shown while explaining how the sample problem is solved.