Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOchoa, Gabrielaen_UK
dc.contributor.authorVerel, Sebastienen_UK
dc.contributor.authorTomassini, Marcoen_UK
dc.contributor.editorSchaefer, Ren_UK
dc.contributor.editorCotta, Cen_UK
dc.contributor.editorKolodziej, Jen_UK
dc.contributor.editorRudolph, Gen_UK
dc.description.abstractThis 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.en_UK
dc.relationOchoa 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.;
dc.relation.ispartofseriesLecture Notes in Computer Science, 6238en_UK
dc.rightsThe 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.en_UK
dc.titleFirst-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapesen_UK
dc.typePart of book or chapter of booken_UK
dc.rights.embargoreason[First-Improvement vs Best-Improvement.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.type.statusVoR - Version of Recorden_UK
dc.citation.btitleParallel Problem Solving from Nature, PPSN XI: 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part Ien_UK
dc.publisher.addressBerlin Heidelbergen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.contributor.affiliationUniversity of Nice Sophia-Antipolis, Franceen_UK
dc.contributor.affiliationUniversity of Lausanneen_UK
rioxxterms.typeBook chapteren_UK
local.rioxx.authorOchoa, Gabriela|0000-0001-7649-5669en_UK
local.rioxx.authorVerel, Sebastien|en_UK
local.rioxx.authorTomassini, Marco|en_UK
local.rioxx.projectInternal Project|University of Stirling|
local.rioxx.contributorSchaefer, R|en_UK
local.rioxx.contributorCotta, C|en_UK
local.rioxx.contributorKolodziej, J|en_UK
local.rioxx.contributorRudolph, G|en_UK
local.rioxx.filenameFirst-Improvement vs Best-Improvement.pdfen_UK
Appears in Collections:Computing Science and Mathematics Book Chapters and Sections

Files in This Item:
File Description SizeFormat 
First-Improvement vs Best-Improvement.pdfFulltext - Published Version228.52 kBAdobe PDFUnder Embargo until 3000-12-01    Request a copy

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

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.