Pregled bibliografske jedinice broj: 1214025
Moth Search Algorithm for Bound Constrained Optimization Problems
Moth Search Algorithm for Bound Constrained Optimization Problems // 5th International Conference Modelling and Development of Intelligent Systems (MDIS 2017)
Sibiu, Rumunjska, 2018. str. 82-91 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 1214025 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Moth Search Algorithm for Bound Constrained
Optimization Problems
Autori
Tuba, Eva ; Capor Hrošik, Romana ; Aihodzic, Adis ; Beko, Marko ; Jovanovic, Raka
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Skup
5th International Conference Modelling and Development of Intelligent Systems (MDIS 2017)
Mjesto i datum
Sibiu, Rumunjska, 23.06.2018. - 25.06.2018
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
swarm intelligence algorithms ; moth search optimization algorithm ; constrained optimization roblems
Sažetak
Numerous real life problems represent hard optimization problems that cannot be solved by deterministic algorithms. In the past decades, various different methods were proposed for these kind of problems and one of the methods are nature inspired algorithms, especially swarm intelligence algorithms. Moth search optimization algorithm (MSO) is on of the recent swarm intelligence algorithm that has not been thoroughly researched. In this paper we tested MSO algorithm on 15 standard benchmark functions and compared results with particle swarm optimization algorithm. Comparison show that MSO has good characteristics and it outperformed other approach from literature.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Ustanove:
Sveučilište u Dubrovniku
