Mostrar el registro sencillo del ítem

dc.contributor.authorChicano-García, José-Francisco 
dc.contributor.authorWhitley, L. Darrell
dc.contributor.authorAlba-Torres, Enrique 
dc.date.accessioned2014-10-03T07:10:22Z
dc.date.available2014-10-03T07:10:22Z
dc.date.issued2014-10-03
dc.identifier.otherdoi:10.1162/EVCO_a_00039
dc.identifier.urihttp://hdl.handle.net/10630/8166
dc.descriptionEvolutionary Computation Journal 19(4):597-637es_ES
dc.description.abstractA small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure of the search space. Many problems are not elementary; however, the objective function of a combinatorial optimization problem can always be expressed as a superposition of multiple elementary landscapes if the underlying neighborhood used is symmetric. This paper presents theoretical results that provide the foundation for algebraic methods that can be used to decompose the objective function of an arbitrary combinatorial optimization problem into a sum of subfunctions, where each subfunction is an elementary landscape. Many steps of this process can be automated, and indeed a software tool could be developed that assists the researcher in finding a landscape decomposition. This methodology is then used to show that the subset sum problem is a superposition of two elementary landscapes, and to show that the quadratic assignment problem is a superposition of three elementary landscapes.es_ES
dc.description.sponsorshipSpanish Ministry of Science and Innovation and FEDER under contract TIN2008-06491-C04-01 (the M∗ project). Andalusian Government under contract P07-TIC- 03044 (DIRICOM project). Air Force Office of Scientific Research, Air Force Materiel Command, USAF, under grant number FA9550-08-1-0422.es_ES
dc.language.isoenges_ES
dc.rightsinfo:eu-repo/semantics/openAccesses_ES
dc.subjectOptimización combinatoriaes_ES
dc.subject.otherElementary landscapeses_ES
dc.subject.otherFitness landscapeses_ES
dc.subject.otherCombinatorial optimizationes_ES
dc.subject.otherDecomposition methodologyes_ES
dc.titleA methodology to find the elementary landscape decomposition of combinatorial optimization problemses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.centroE.T.S.I. Informáticaes_ES
dc.type.hasVersioninfo:eu-repo/semantics/submittedVersiones_ES


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem