Страница публикации

On Some Variants of the Merging Variables Based (1+1)-Evolutionary Algorithm with Application to MaxSAT Problem

Авторы: Semenov A., Otpuschennikov I., Antonov K.

Журнал: Lecture Notes in Computer Science: 20th Intern. Conf. on Mathematical Optimization Theory and Operations Research, MOTOR 2021 (Irkutsk, 5-10 July 2021)

Том: 12755

Номер:

Год: 2021

Отчётный год: 2021

Издательство:

Местоположение издательства:

URL:

Проекты:

DOI: 10.1007/978-3-030-77876-7_8

Аннотация: In this paper we describe a new evolutionary strategy. It is based on the common (1+1) random mutation scheme which was augmented with metaheuristic technique named merging variables principle, that was proposed by us in previous works. We show that the new variant of (1+1)-EA has asymptotically lower worst case estimation than the original (1+1)-EA. In the experimental part we conduct comparison of the proposed strategy with several known variants of (1+1)-EA and demonstrate its practical applicability for a number of hard instances of MaxSAT problem.

Индексируется WOS: Нет

Индексируется Scopus: Нет

Индексируется УБС: Нет

Индексируется РИНЦ: Да

Индексируется ВАК: Нет

Индексируется CORE: Нет

Публикация в печати: 0