Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWhitley, Darrellen_UK
dc.contributor.authorSutton, Andrew Men_UK
dc.contributor.authorOchoa, Gabrielaen_UK
dc.contributor.authorChicano, Franciscoen_UK
dc.description.abstractLocal search algorithms exploit moves on an adjacency graph of the search space. An "elementary landscape" exists if the objective function f is an eigenfunction of the Laplacian of the graph induced by the neighborhood operator; this allows various statistics about the neighborhood to be computed in closed form. A new component based model makes it relatively simple to prove that certain types of landscapes are elementary. The traveling salesperson problem, weighted graph (vertex) coloring and the minimum graph bisection problem yield elementary landscapes under commonly used local search operators. The component model is then used to efficiently compute the mean objective function value over partial neighborhoods for these same problems. For a traveling salesperson problem over n cities, the 2-opt neighborhood can be decomposed into ⌊n/2-1⌋⌊n/2-1⌋ partial neighborhoods. For graph coloring and the minimum graph bisection problem, partial neighborhoods can be used to focus search on those moves that are capable of producing a solution with a strictly improving objective function value.en_UK
dc.relationWhitley D, Sutton AM, Ochoa G & Chicano F (2014) The component model for elementary landscapes and partial neighborhoods. Theoretical Computer Science, 545 p. 75.
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.subjectFitness landscape analysisen_UK
dc.subjectStochastic local searchen_UK
dc.subjectElementary landscapesen_UK
dc.titleThe component model for elementary landscapes and partial neighborhoodsen_UK
dc.typeJournal Articleen_UK
dc.rights.embargoreason[Theoretical Computer Science 2014.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.citation.jtitleTheoretical Computer Scienceen_UK
dc.type.statusVoR - Version of Recorden_UK
dc.contributor.affiliationColorado State Universityen_UK
dc.contributor.affiliationFriedrich Schiller University of Jenaen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.contributor.affiliationUniversity of Malagaen_UK
dc.description.refREF Compliant by Deposit in Stirling's Repositoryen_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
Theoretical Computer Science 2014.pdfFulltext - Published Version484.66 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 providing details and we will remove the Work from public display in STORRE and investigate your claim.