Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/29468
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChicano, Franciscoen_UK
dc.contributor.authorOchoa, Gabrielaen_UK
dc.contributor.authorWhitley, Darrellen_UK
dc.contributor.authorTinós, Renatoen_UK
dc.contributor.editorLiefooghe, Aen_UK
dc.contributor.editorPaquete, Len_UK
dc.date.accessioned2019-05-11T00:01:15Z-
dc.date.available2019-05-11T00:01:15Z-
dc.date.issued2019en_UK
dc.identifier.urihttp://hdl.handle.net/1893/29468-
dc.description.abstractThe output of an optimal recombination operator for two parent solutions is a solution with the best possible value for the objective function among all the solutions fulfilling the gene transmission property: the value of any variable in the offspring must be inherited from one of the parents. This set of solutions coincides with the largest dynastic potential for the two parent solutions of any recombination operator with the gene transmission property. In general, exploring the full dynastic potential is computationally costly, but if the variables of the objective function have a low number of non-linear interactions among them, the exploration can be done in O(4β(n+m)+n2) time, for problems with n variables, m subfunctions and β a constant. In this paper, we propose a quasi-optimal recombination operator, called Dynastic Potential Crossover (DPX), that runs in O(4β(n+m)+n2) time in any case and is able to explore the full dynastic potential for low-epistasis combinatorial problems. We compare this operator, both theoretically and experimentally, with two recently defined efficient recombination operators: Partition Crossover (PX) and Articulation Points Partition Crossover (APX). The empirical comparison uses NKQ Landscapes and MAX-SAT instances.en_UK
dc.language.isoenen_UK
dc.publisherSpringer International Publishingen_UK
dc.relationChicano F, Ochoa G, Whitley D & Tinós R (2019) Quasi-Optimal Recombination Operator. In: Liefooghe A & Paquete L (eds.) Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, 11452. EvoCOP 2019: European Conference on Evolutionary Computation in Combinatorial Optimization, Leipzig, Germany, 24.04.2019-26.04.2019. Cham, Switzerland: Springer International Publishing, pp. 131-146. https://doi.org/10.1007/978-3-030-16711-0_9en_UK
dc.relation.ispartofseriesLecture Notes in Computer Science, 11452en_UK
dc.rightsThis is a post-peer-review, pre-copyedit version of an article published in Liefooghe A & Paquete L (eds.) Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, 11452. EvoCOP 2019: European Conference on Evolutionary Computation in Combinatorial Optimization, Leipzig, Germany, 24.04.2019-26.04.2019. Cham, Switzerland: Springer International Publishing, pp. 131-146. The final authenticated version is available online at: https://doi.org/10.1007/978-3-030-16711-0_9en_UK
dc.subjectRecombination operatoren_UK
dc.subjectDynastic potentialen_UK
dc.subjectGray box optimizationen_UK
dc.titleQuasi-Optimal Recombination Operatoren_UK
dc.typeConference Paperen_UK
dc.identifier.doi10.1007/978-3-030-16711-0_9en_UK
dc.citation.issn1611-3349en_UK
dc.citation.issn0302-9743en_UK
dc.citation.spage131en_UK
dc.citation.epage146en_UK
dc.citation.publicationstatusPublisheden_UK
dc.type.statusAM - Accepted Manuscripten_UK
dc.citation.btitleEvolutionary Computation in Combinatorial Optimizationen_UK
dc.citation.conferencedates2019-04-24 - 2019-04-26en_UK
dc.citation.conferencelocationLeipzig, Germanyen_UK
dc.citation.conferencenameEvoCOP 2019: European Conference on Evolutionary Computation in Combinatorial Optimizationen_UK
dc.citation.date28/03/2019en_UK
dc.citation.isbn9783030148119en_UK
dc.citation.isbn9783030148126en_UK
dc.publisher.addressCham, Switzerlanden_UK
dc.contributor.affiliationUniversity of Malagaen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.contributor.affiliationColorado State Universityen_UK
dc.contributor.affiliationUniversity of Sao Pauloen_UK
dc.identifier.wtid1278468en_UK
dc.contributor.orcid0000-0003-1259-2990en_UK
dc.contributor.orcid0000-0001-7649-5669en_UK
dc.contributor.orcid0000-0003-4027-8851en_UK
dc.date.accepted2019-01-14en_UK
dc.date.filedepositdate2019-05-10en_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
QuasiOptimalRecombination.pdfFulltext - Accepted Version347.53 kBAdobe 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 library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.