By Topic

A stochastic tabu search strategy and its global convergence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Peng Tian ; Dept. of Inf. Syst., City Univ. of Hong Kong, Kowloon, Hong Kong ; Jian Ma ; Fan Zhiping

Tabu search (TS) is a metaheuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. It has achieved widespread successes in solving practical optimization problems. This paper proposes the stochastic TS strategy for discrete optimization and makes an investigation of its global convergence. The strategy considered introduces the Metropolis criterion and simulated annealing process into a general framework of TS. It has been proved that the strategy converges asymptotically to global optimal solutions, and satisfies the necessary and sufficient conditions for global asymptotic convergence. Furthermore, it produces a higher convergent rate than the simulated annealing algorithm

Published in:

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on  (Volume:1 )

Date of Conference:

12-15 Oct 1997