Library

Drift Analysis

Drift analysis is one of the major tools for analysing evolutionary algorithms and nature-inspired search heuristics. In this chapter we give an introduction to drift analysis and give some examples of how to use it for the analysis of evolutionary algorithms.

cs.NEmath.PRComputer ScienceMathematics
View graphSource

Paper

Similar papers

Estimate Hitting Time by Hitting Probability for Elitist Evolutionary AlgorithmsJun He, Siang Yew Chong, Xin Yao2025 · IEEE Transactions on Evolutionary Computation · 2 citations In Library
Estimation of Hitting Time by Hitting Probability for Elitist Evolutionary AlgorithmsJun He, Siang Yew Chong, Xin Yao2025 · IEEE Transactions on Evolutionary Computation In Library
Drift Detection and Evaluation FrameworksA. Jacobs2026 · Open MIND In Library
Genetic Drift and its Effects on the Performance of Genetic Algorithm(GA)Sami Ullah, Mohsin Masood2023 In Library
Analysis of Drifting FeaturesFabian Hinder, Jonathan Jakob, Barbara Hammer2020 · arXiv (Cornell University) In Library
Drift Analysis and Evolutionary Algorithms RevisitedJ. Lengler, A. Steger2016 · Combinatorics, probability & computing · 55 citations In Library
Open-Source Drift Detection Tools in Action: Insights from Two Use CasesRieke Müller, Mohamed Abdelaal, Davor Stjelja2024 · arXiv (Cornell University) In Library
Average Drift Analysis and Population ScalabilityJun He, X. Yao2013 · IEEE Transactions on Evolutionary Computation · 17 citations In Library
Drift Analysis with Fitness Levels for Elitist Evolutionary AlgorithmsJun He, Yuren Zhou2023 · arXiv (Cornell University) · 8 citations In Library
Data-Driven Evolutionary Computation Under Continuously Streaming Environments: A Drift-Aware ApproachYuan-Ting Zhong, Yue‐Jiao Gong2025 · IEEE Transactions on Evolutionary Computation · 5 citations In Library
© 2026 NYSGPT2525 LLC