Evolutionary-Based Iterative Local Search Algorithm for the Shortest Common Supersequence Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00184914" target="_blank" >RIV/68407700:21230/11:00184914 - isvavai.cz</a>
Result on the web
<a href="http://dl.acm.org/citation.cfm?id=2001620" target="_blank" >http://dl.acm.org/citation.cfm?id=2001620</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2001576.2001620" target="_blank" >10.1145/2001576.2001620</a>

Result language
angličtina
Original language name
Evolutionary-Based Iterative Local Search Algorithm for the Shortest Common Supersequence Problem
Original language description
This paper presents two extensions of recently proposed evolutionary-based iterative local search algorithm called POEMS for solving the Shortest Common Supersequence (SCS) problem. Both extensions improve scalability of the algorithm. The first one improves the efficiency of the evaluation procedure and the second one further improves optimization capabilities of the algorithm by intensifying the search towards short supersequence. The proposed algorithm performs very well, it produces significantly better solutions than the baseline Deposition and Reduction algorithm on large benchmarks.
Czech name
—
Czech description
—

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation
ISBN
978-1-4503-0557-0
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
315-322
Publisher name
ACM
Place of publication
New York
Event location
Dublin
Event date
Jul 12, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)