Convergence Analysis of Adaptive Tabu Search

Deacha Puangdownreong, Sarawut Sujitjorn^* and Thanatchai Kulworawanichpong

ABSTRACT: This paper presents a convergence proof of the adaptive tabu search (ATS) algorithms. The proof consists of two parts, i.e. convergence proof of all interested solutions in a finite search space, and that of searching processes of the ATS algorithms to the global minimum. With the proposed definitions and theorems, the proofs show that the ATS algorithms based on a random process have finite convergence. The searching process also converges to the (near) global minimum rapidly. Two applications, the global minimum finding of Bohachevsky’s function and the identification of the nonlinear pendulum model, serve to illustrate the effectiveness of the ATS algorithms.

Download PDF

a School of Electrical Engineering, Suranaree University of Technology, Nakhon Ratchasima, 30000, Thailand.

* Corresponding author, E-mail: sarawut@ccs.sut.ac.th.

Received 28 Mar 2003, Accepted 30 Jan 2004