Related Experiment Video
Updated: May 17, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
Published on: March 1, 2022
On the taxonomy of optimization problems under estimation of distribution algorithms
Carlos Echegoyen1, Alexander Mendiburu, Roberto Santana
1Intelligent Systems Group, Department of Computer Science and Artificial Intelligence, The University of the Basque Country (UPV/EHU). Paseo Manuel de Lardizábal 1. 20018 San Sebastian, Spain. carlos.echegoyen@ehu.es
This study introduces a problem taxonomy for estimation of distribution algorithms (EDAs) by defining an equivalence relation. It reveals how the probabilistic model dictates algorithm behavior and problem partitioning in optimization.
Area of Science:
- Optimization
- Computer Science
- Artificial Intelligence
Background:
- Understanding search algorithm behavior is crucial in optimization.
- Estimation of Distribution Algorithms (EDAs) are a key area of study.
- Problem taxonomies are needed to classify optimization challenges.
Purpose of the Study:
- To establish foundations for problem taxonomies under EDAs.
- To group optimization problems based on EDA behavior.
- To define an equivalence relation for partitioning the problem space.
Main Methods:
- Utilizing an infinite population model with rank-based selection.
- Defining an equivalence relation between objective functions.
- Analyzing the probabilistic model's role in problem partitioning.
Main Results:
- The probabilistic model determines the number of distinct algorithm behaviors.
- Functions are grouped into equivalence classes based on EDA behavior.
- Univariate EDAs show a direct relationship with Hamming distance neighborhood systems.
Conclusions:
- The proposed taxonomy classifies problems for EDAs.
- The probabilistic model is central to understanding EDA performance.
- All functions belong to the same equivalence class without probabilistic model restrictions.
Related Concept Videos
Distributions to Estimate Population Parameter
Optimization Problems
Probability Distributions
A discrete probability distribution is a probability distribution of discrete random variables. It can be categorized into binomial probability distribution and Poisson probability...
Methods of Medium Optimization
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Optimal Foraging