Authors: Brimberg, Jack
Hansen, Pierre
Mladenović, Nenad 
Title: Attraction probabilities in variable neighborhood search
Journal: 4OR : A Quarterly Journal of Operations Research
Volume: 8
Issue: 2
First page: 181
Last page: 194
Issue Date: 1-Jan-2010
Rank: M23
ISSN: 1619-4500
DOI: 10.1007/s10288-009-0108-x
Empirical evidence demonstrates that when the same local search operator is used, variable neighborhood search consistently outperforms random multistart local search on all types of combinatorial and global optimization problems tested. In this paper we suggest that this superiority in performance may be explained by the distribution of the attraction basins around a current solution as a function of the distance from the solution. We illustrate with a well-known instance of the multisource Weber problem that the "attraction probabilities" for finding better solutions can be orders of magnitude larger in neighborhoods that are close to the current solution. The paper also discusses the global convergence properties of both general methods in the context of attraction probabilities.
Keywords: Attraction probabilities | Continuous location | Convergence | Metaheuristics | Variable neighborhood search
Publisher: Springer Link

Show full item record


checked on May 16, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.