Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Moth Search Algorithm for Bound Constrained Optimization Problems (CROSBI ID 722720)

Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija

Tuba, Eva ; Capor Hrošik, Romana ; Aihodzic, Adis ; Beko, Marko ; Jovanovic, Raka Moth Search Algorithm for Bound Constrained Optimization Problems. 2018. str. 82-91

Podaci o odgovornosti

Tuba, Eva ; Capor Hrošik, Romana ; Aihodzic, Adis ; Beko, Marko ; Jovanovic, Raka

engleski

Moth Search Algorithm for Bound Constrained Optimization Problems

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.

swarm intelligence algorithms ; moth search optimization algorithm ; constrained optimization roblems

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

82-91.

2018.

objavljeno

Podaci o matičnoj publikaciji

Podaci o skupu

5th International Conference Modelling and Development of Intelligent Systems (MDIS 2017)

predavanje

23.06.2018-25.06.2018

Sibiu, Rumunjska

Povezanost rada

Matematika, Računarstvo