UNAPREÐENJE HIBRIDIZACIJOM METAHEURISTIKA INTELIGENCIJE ROJEVA ZA REŠAVANJE PROBLEMA GLOBALNE OPTIMIZACIJE

eLibrary

 
 

UNAPREÐENJE HIBRIDIZACIJOM METAHEURISTIKA INTELIGENCIJE ROJEVA ZA REŠAVANJE PROBLEMA GLOBALNE OPTIMIZACIJE

Show simple item record

dc.contributor.advisor Tuba, Milan
dc.contributor.author Bačanin Džakula, Nebojša
dc.date.accessioned 2026-11-10T16:28:08Z
dc.date.available 2026-11-10T16:28:08Z
dc.date.issued 2015
dc.identifier.uri http://hdl.handle.net/123456789/5841
dc.description.abstract Hard optimization problems that cannot be solved within acceptable computational time by deterministic mathematical methods have been successfully solved in recent years by population-based stochastic metaheuristics, among which swarm intelli- gence algorithms represent a prominent class. This thesis investigates improvements of the swarm intelligence metaheuristics by hybridization. During analysis of the existing swarm intelligence metaheuristics in some cases de ciencies and weaknesses in the solution space search mechanisms were observed, primarily as a consequence of the mathematical model that simulates natural process as well as inappropriate balance between intensi cation and diversi cation. The thesis examines whether existing swarm intelligence algorithms for global op- timization could be improved (in the sense of obtaining better results, faster con- vergence, better robustness) by hybridization with other algorithms. A number of hybridized swarm intelligence metaheuristics were developed and implemented. Considering the fact that good hybrids are not created as a random combination of individual functional elements and procedures from di erent algorithms, but rather established on comprehensive analysis of the functional principles of the algorithms that are used in the process of hybridization, development of the hybrid approaches was preceded by thorough research of advantages and disadvantages of each involved algorithm in order to determine the best combination that neutralizes disadvantages of one approach by incorporating the strengths of the other. Developed hybrid approaches were veri ed by testing on standard benchmark sets for global optimization, with and without constraints, as well as on well-known practical problems. Comparative analysis with the state-of-the-art algorithms from the lite- rature demonstrated quality of the developed hybrids and con rmed the hypothesis that swarm intelligence algorithms can be successfully improved by hybridization. Keywords: swarm intelligence metaheuristics, hybrid algorithms, global optimiza- tion. en_US
dc.description.provenance Submitted by Slavisha Milisavljevic (slavisha) on 2026-11-10T16:28:08Z No. of bitstreams: 1 BacaninTeza.pdf: 2245636 bytes, checksum: 6c46361e73e1b05cfe6e069262106927 (MD5) en
dc.description.provenance Made available in DSpace on 2026-11-10T16:28:08Z (GMT). No. of bitstreams: 1 BacaninTeza.pdf: 2245636 bytes, checksum: 6c46361e73e1b05cfe6e069262106927 (MD5) Previous issue date: 2015 en
dc.language.iso sr en_US
dc.publisher Beograd en_US
dc.title UNAPREÐENJE HIBRIDIZACIJOM METAHEURISTIKA INTELIGENCIJE ROJEVA ZA REŠAVANJE PROBLEMA GLOBALNE OPTIMIZACIJE en_US
mf.author.birth-date 1983-01-13
mf.author.birth-place Beograd en_US
mf.author.birth-country Srbija en_US
mf.author.residence-state Srbija en_US
mf.author.citizenship Srpsko en_US
mf.author.nationality Srbin en_US
mf.subject.area Computer Science en_US
mf.subject.keywords warm intelligence metaheuristics, hybrid algorithms, global optimiza- tion en_US
mf.subject.subarea Artificial Intelligence en_US
mf.contributor.committee Živković, Miodrag
mf.contributor.committee Dugošija, Đ
mf.contributor.committee Xin-She, Xin-She
mf.university.faculty Mathematical Faculty en_US
mf.document.references 173 en_US
mf.document.pages 225 en_US
mf.document.location Beograd en_US
mf.document.genealogy-project No en_US
mf.university Belgrade University en_US

Files in this item

Files Size Format View
BacaninTeza.pdf 2.245Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record