Tabu guided generalized hill climbing algorithms

Tabu guided generalized hill climbing algorithms

0.00 Avg rating0 Votes
Article ID: iaor20053325
Country: Germany
Volume: 6
Issue: 3
Start Page Number: 343
End Page Number: 354
Publication Date: Sep 2004
Journal: Methodology and Computing in Applied Probability
Authors: ,
Keywords: heuristics
Abstract:

This paper formulates tabu search strategies that guide generalized hill climbing (GHC) algorithms for addressing NP-hard discrete optimization problems. The resulting framework, termed tabu guided generalized hill climbing (TG2HC) algorithms, uses a tabu release parameter that probabilistically accepts solutions currently on the tabu list. TG2HC algorithms are modeled as a set of stationary Markov chains, where the tabu list is fixed for each outer loop iteration. This framework provides practitioners with guidelines for developing tabu search strategies to use in conjunction with GHC algorithms that preserve some of the algorithms' known performance properties. In particular, sufficient conditions are obtained that indicate how to design iterations of problem-specific tabu search strategies, where the stationary distributions associated with each of these iterations converge to the distribution with zero weight on all non-optimal solutions.

Reviews

Required fields are marked *. Your email address will not be published.