Discretization of Decision Variables in Optimization Algorithms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F18%3APU127873" target="_blank" >RIV/00216305:26220/18:PU127873 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Discretization of Decision Variables in Optimization Algorithms
Original language description
This paper presents a verification of universal method for discretization of decision space in optimization algorithms. Real-world optimization tasks frequently use discontinuous decision variables and in order to effectively optimize such tasks, it is necessary to exploit an optimization algorithm that meets such requirement. Unfortunately, very few evolutionary algorithms can naturally work with discontinuous decision space. The method that entitles all optimization algorithms to effectively solve problems with discrete variables is here described and experimentally verified.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
20201 - Electrical and electronic engineering
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 24th Conference STUDENT EEICT 2018
ISBN
978-80-214-5614-3
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
320-324
Publisher name
Neuveden
Place of publication
Brno
Event location
Brno
Event date
Apr 26, 2018
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—