Discrete Optimization Algorithm Based on Probability Distribution with Transformation of Target Values

Problems of search optimization in a discrete space, particularly, in a binary space where a variable can take only two values, are of great practical importance. This paper proposes a new population-based discrete optimization algorithm that uses probability distributions of variables. The distribu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Programming and computer software Ročník 50; číslo 6; s. 445 - 456
Hlavní autor: Sarin, K. S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.12.2024
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Computer Science
Design
Efficiency
Embedded systems
Genetic algorithms
Integer programming
Methods
Operating Systems
Optimization
Optimization algorithms
Probability
Software Engineering
Software Engineering/Programming and Operating Systems
discrete optimization
binary optimization
stochastic algorithms
metaheuristics
optimization methods
and probability distribution
ISSN:0361-7688, 1608-3261
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Problems of search optimization in a discrete space, particularly, in a binary space where a variable can take only two values, are of great practical importance. This paper proposes a new population-based discrete optimization algorithm that uses probability distributions of variables. The distributions determine the probability of taking one or another discrete value and are generated by transforming target values of solutions into their weight coefficients. The performance of the algorithm is evaluated using unimodal and multimodal test functions with binary variables. The experimental results demonstrate the high efficiency of the proposed algorithm in terms of convergence rate and stability.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768824700312