Research of binary bat algorithm on example of the discrete optimization task

The results of developing a mathematical model to uniform representation of the problem statement for row of dynamic problems of discrete optimization are presented. The model is applicable for tasks from different subject areas with a similar interpretation in terms of graph theory. The model is de...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2016 2nd International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM) s. 1 - 6
Hlavní autoři: Mokhov, V. A., Grinchenkov, D. V., Spiridonova, I. A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2016
Témata:
Algorithm design and analysis
Convergence
evolutionary computation
graph theory
Heuristic algorithms
Industrial engineering
intelligent agents
Manufacturing
multi-agent systems
Optimization
optimization methods
Planets
system analysis and design
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í:The results of developing a mathematical model to uniform representation of the problem statement for row of dynamic problems of discrete optimization are presented. The model is applicable for tasks from different subject areas with a similar interpretation in terms of graph theory. The model is designed for solving discrete optimization with the algorithm of agent-based metaheuristics. According to the results of some numerical experiments, collection and analysis of statistical information of application of the bat algorithm in solving dynamic problems of discrete optimization were carried out. Analysis of the obtained statistics is used to identify the characteristics of and rules for setting the bat algorithm.
DOI:10.1109/ICIEAM.2016.7911659