A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions - Archive ouverte HAL
Journal Articles Algorithmica Year : 2022

A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions

Abstract

The (1 + (λ, λ)) genetic algorithm is a younger evolutionary algorithm trying to profit also from inferior solutions. Rigorous runtime analyses on unimodal fitness functions showed that it can indeed be † Extended version of the paper [ADK20] in the proceedings of GECCO 2020. This version contains all proofs and other details that had to be omitted in the conference version for reasons of space. Also, we have added a new section which proves the lower bounds.

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
2004.06702.pdf (330.93 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Benjamin Doerr  : Connect in order to contact the contributor

https://hal.science/hal-03652685

Submitted on : Tuesday, April 26, 2022-10:15:33 PM

Last modification on : Thursday, August 1, 2024-5:08:02 PM

Long-term archiving on : Wednesday, July 27, 2022-7:49:51 PM

Download

Dates and versions

hal-03652685 , version 1 (26-04-2022)

Identifiers

Cite

Denis Antipov, Benjamin Doerr, Vitalii Karavaev. A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions. Algorithmica, 2022, ⟨10.1007/s00453-021-00907-7⟩. ⟨hal-03652685⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

X CNRS LIX X-LIX X-DEP-INFO IP_PARIS ANR
35 View
47 Download

Altmetric

Share

More