On the Difficulty of Evolving Permutation Codes (CROSBI ID 722192)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Mariot, Luca ; Picek, Stjepan ; Jakobović, Domagoj ; Đurasević, Marko ; Leporati, Alberto
engleski
On the Difficulty of Evolving Permutation Codes
Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline communications, flash memories, and block ciphers. This paper addresses the design of permutation codes by evolutionary algorithms (EA) by developing an iterative approach. Starting from a single random permutation, new permutations satisfying the minimum distance constraint are incrementally added to the code by using a permutation-based EA. We investigate our approach against four different fitness functions targeting the minimum distance requirement at different levels of detail and with two different policies concerning code expansion and pruning. We compare the results achieved by our EA approach to those of a simple random search, remarking that neither method scales well with the problem size.
Permutation codes ; Evolutionary algorithms ; Incremental construction ; Powerline communications ; Flash memories ; Block ciphers
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
141-156.
2022.
objavljeno
10.1007/978-3-031-02462-7_10
Podaci o matičnoj publikaciji
Lecture Notes in Computer Science
Springer
978-3-031-02461-0
Podaci o skupu
International Conference on the Applications of Evolutionary Computation
predavanje
20.04.2022-22.04.2022
Madrid, Španjolska