Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem

The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. We consider the use of memetic algorithms (MAs) for solving this problem. A specialized local-improvement operator based on character removal and heuristic repairing plays a c...

Descripción completa

Detalles Bibliográficos
Autor principal: Cotta, Carlos
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2005
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7121528/
http://dx.doi.org/10.1007/11499305_9

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7121528/
http://dx.doi.org/10.1007/11499305_9

Ejemplares similares