Text

Novel Random Key Encoding Schemes for the Differential Evolution of Permutation Problems

Differential evolution is a powerful nature-inspired real-parameter optimization algorithm that has been successfully used to solve a number of hard optimization problems. It has been used to tackle both continuous and discrete optimization problems. The application of a continuous method to discrete problems involves several challenges, including solution representation and search space–solution space mapping. In this work, we study random key encoding, a popular encoding scheme that is used to represent permutations in high-dimensional continuous spaces. We analyze the search space it constitutes, study its structure and properties, and introduce two novel modifications of the encoding. We investigate the proposed encoding strategies in the context of four variants of the differential evolution algorithm and demonstrate their usefulness for two widespread permutation problems: 1) the linear ordering problem and 2) the traveling salesman problem.

Ketersediaan

Informasi Detail

Judul Seri

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION; Vol.26 No.1 January 2022

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 43-57

Bahasa

English

ISBN/ISSN

-

Klasifikasi

NONE

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

DIFFERENTIAL EVOLUTION (DE)
RANDOM KEY (RK) ENCODING
SEARCH SPACE ANALYSIS
TRAVELING SALESMAN PROBLEM (TSP)

Info Detail Spesifik

DOI: 10.1109/TEVC.2021.3087802

Pernyataan Tanggungjawab

Pavel Kromer, Vojtech Uher, Vaclav Snasel

Versi lain/terkait

Lampiran Berkas

Komentar