Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/11051
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOchoa, Gabriela-
dc.contributor.authorVerel, Sebastien-
dc.contributor.authorTomassini, Marco-
dc.contributor.editorSchaefer, R-
dc.contributor.editorCotta, C-
dc.contributor.editorKolodziej, J-
dc.contributor.editorRudolph, G-
dc.date.accessioned2016-10-25T22:30:49Z-
dc.date.issued2010-
dc.identifier.urihttp://hdl.handle.net/1893/11051-
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.language.isoen-
dc.publisherSpringer-
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 (ed.). 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, 6238-
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.-
dc.titleFirst-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapesen_UK
dc.typePart of book or chapter of booken_UK
dc.rights.embargodate2999-12-31T00:00:00Z-
dc.rights.embargoreasonThe 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.-
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-642-15844-5_11-
dc.citation.issn0302-9743-
dc.citation.volume6238-
dc.citation.spage104-
dc.citation.epage113-
dc.citation.publicationstatusPublished-
dc.type.statusBook Chapter: publisher version-
dc.identifier.urlhttp://link.springer.com/chapter/10.1007%2F978-3-642-15844-5_11?LI=true#-
dc.author.emailgabriela.ochoa@cs.stir.ac.uk-
dc.citation.btitleParallel Problem Solving from Nature, PPSN XI: 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part I-
dc.citation.isbn978-3-642-15843-8-
dc.publisher.addressBerlin Heidelberg-
dc.contributor.affiliationComputing Science - CSM Dept-
dc.contributor.affiliationUniversity of Nice Sophia-Antipolis, France-
dc.contributor.affiliationUniversity of Lausanne-
dc.rights.embargoterms2999-12-31-
dc.rights.embargoliftdate2999-12-31-
dc.identifier.isi000286565200011-
Appears in Collections:Computing Science and Mathematics Book Chapters and Sections

Files in This Item:
File Description SizeFormat 
First-Improvement vs Best-Improvement.pdf228.52 kBAdobe PDFUnder Permanent Embargo    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.

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