|Appears in Collections:||Computing Science and Mathematics Book Chapters and Sections|
|Title:||First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes|
|Citation:||Ochoa G, Verel S & Tomassini M (2010) First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes. In: Schaefer R, Cotta C, Kolodziej J & Rudolph G (eds.) Parallel Problem Solving from Nature, PPSN XI: 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part I. Lecture Notes in Computer Science, 6238. Berlin Heidelberg: Springer, pp. 104-113. http://link.springer.com/chapter/10.1007%2F978-3-642-15844-5_11?LI=true#; https://doi.org/10.1007/978-3-642-15844-5_11|
|Series/Report no.:||Lecture Notes in Computer Science, 6238|
|Abstract:||This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedy-ascent) hill-climbing algorithm, instead of a best-improvement (steepest-ascent) one, for the definition and extraction of the basins of attraction of the landscape optima. A statistical analysis comparing best and first improvement network models for a set of NK landscapes, is presented and discussed. Our results suggest structural differences between the two models with respect to both the network connectivity, and the nature of the basins of attraction. The impact of these differences in the behavior of search heuristics based on first and best improvement local search is thoroughly discussed.|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|First-Improvement vs Best-Improvement.pdf||Fulltext - Published Version||228.52 kB||Adobe PDF||Under Embargo until 3000-12-01 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.