Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOchoa, Gabrielaen_UK
dc.contributor.authorVeerapen, Nadarajenen_UK
dc.contributor.editorChicano, Fen_UK
dc.contributor.editorHu, Ben_UK
dc.contributor.editorGarcía-Sánchez, Pen_UK
dc.description.abstractThe big valley hypothesis suggests that, in combinatorial optimisation, local optima of good quality are clustered and surround the global optimum. We show here that the idea of a single valley does not always hold. Instead the big valley seems to de-construct into several valleys, also called ‘funnels’ in theoretical chemistry. We use the local optima networks model and propose an effective procedure for extracting the network data. We conduct a detailed study on four selected TSP instances of moderate size and observe that the big valley decomposes into a number of sub-valleys of different sizes and fitness distributions. Sometimes the global optimum is located in the largest valley, which suggests an easy to search landscape, but this is not generally the case. The global optimum might be located in a small valley, which offers a clear and visual explanation of the increased search difficulty in these cases. Our study opens up new possibilities for analysing and visualising combinatorial landscapes as complex networks.en_UK
dc.publisherSpringer International Publishingen_UK
dc.relationOchoa G & Veerapen N (2016) Deconstructing the Big Valley Search Space Hypothesis In: Chicano F, Hu B & García-Sánchez P (eds.) Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings. Lecture Notes in Computer Science, 9595. 16th European Conference on Evolutionary Computation in Combinatorial Optimisation, EvoCOP 2016, Cham, Switzerland, 30.03.2016-01.04.2016. Cham, Switzerland: Springer International Publishing, pp. 58-73.;
dc.relationDAASE: Dynamic Adaptive Automated Software Engineeringen_UK
dc.relation.ispartofseriesLecture Notes in Computer Science, 9595en_UK
dc.rightsPublisher policy allows this work to be made available in this repository, Published in Evolutionary Computation in Combinatorial Optimization by Springer 2016; The final publication is available at Springer via
dc.subjectFitness Landscapesen_UK
dc.subjectLocal Optima Networksen_UK
dc.subjectTraveling Salesman Problemen_UK
dc.titleDeconstructing the Big Valley Search Space Hypothesisen_UK
dc.typeConference Paperen_UK
dc.type.statusAM - Accepted Manuscripten_UK
dc.contributor.funderEngineering and Physical Sciences Research Councilen_UK
dc.citation.btitleEvolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedingsen_UK
dc.citation.conferencedates2016-03-30 - 2016-04-01en_UK
dc.citation.conferencelocationPorto, Portugalen_UK
dc.citation.conferencename16th European Conference on Evolutionary Computation in Combinatorial Optimisation, EvoCOP 2016en_UK
dc.publisher.addressCham, Switzerlanden_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.description.refREF Compliant by Deposit in Stirling's Repositoryen_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
evocop2016-deconstructing-big-valley.pdfFulltext - Accepted Version; : Author-created version of the conference paper2.02 MBAdobe PDFView/Open

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.