A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Sorting unsigned permutations by reversals is a difficult problem; indeed, it was proved to be N P-hard by Caprara (1997) . ... The first one uses the technique of opposition-based learning leading to an opposition-based memetic algorithm; the second one improves the previous algorithm by applying the heuristic of two breakpoint ... Evolutionary Computation Volume 27, Number 2 Conclusion This article proposed two new memetic algorithms for sorting unsigned permutations by reversals: OBMA and Hybrid-OBMA. ...doi:10.1162/evco_a_00220 pmid:29466026 fatcat:a4sdcc2uz5hihkxj3t7fqwaidy
As distinguished feature, the proposed GA uses as fitness function the translocation distance for randomly generated signed versions of the unsigned genomes. ... For the case of genomes represented as strings, symbols represent genes and chromosomes are modeled as substrings of the genomes; thus, translocation is an operation that models the interaction between ... ACKNOWLEDGMENT The authors would like to thank the Brazilian agencies CAPES and CNPq for funding this work with scholarships and a universal grant. ...doi:10.1109/clei.2015.7359994 dblp:conf/clei/SilveiraSLA15 fatcat:s6lwqex23bcfpdsrsachzt25fa