Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00156838" target="_blank" >RIV/68407700:21230/09:00156838 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations
Original language description
This paper presents an application of a prototype optimization with evolved improvement steps algorithm (POEMS) to the well-known problem of optimal sorting network design. The POEMS is an iterative algorithm that seeks the best variation of the currentsolution in each iteration. For experimental evaluation 10-input, 12-input, 14-input and 16-input instances of the sorting network problem were used. Results show that the proposed POEMS approach clearly outperforms both compared algorithms. Moreover, POEMS was able to find several perfect networks that are equivalent w.r.t. the number of comparators to the best known solutions for the 10-input, 12-input, 14-input, and 16-input problems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Genetic and Evolutionary Computation Conference 2009
ISBN
978-1-60558-325-9
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
ACM
Place of publication
New York
Event location
Montreal
Event date
Jul 8, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—