Moth Search Algorithm for Bound Constrained Optimization Problems

Raka Jovanovic, Eva Tuba, Romana Capor-Hrosik, Adis Alihodzic, Marko Beko

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationProceeding of the 5th International Conference MDIS
Subtitle of host publicationModelling and Development of Intelligent Systems
Publication statusPublished - Jun 2017
Externally publishedYes

Fingerprint

Dive into the research topics of 'Moth Search Algorithm for Bound Constrained Optimization Problems'. Together they form a unique fingerprint.

Cite this