crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 712159

Časopis

Autori: Ivković, Nikola; Golub, Marin
Naslov: A New Ant Colony Optimization Algorithm : Three Bound Ant System
Izvornik: Lecture Notes in Computer Science (0302-9743) 8667 (2014); 280-281
Vrsta rada: kratko priopcenje
Ključne riječi: algorithm ; optimization ; ant colony optimization ; swarm intelligence
Sažetak:
Abstract. Since its introduction, ant colony optimization (ACO) algorithms has been gradually improved and now can offer very good performance for many hard discrete optimization problems. Among the most popular variant of ACO is MAX-MIN ant system (MMAS), which have excellent properties for many optimization problems. In this paper, we propose a new ACO algorithm, named three bounds ant system (TBAS), which we perceive as further evolution and improvement of MMAS. We analyze some properties of TBAS algorithm and experimentally compare its performance with MMAS algorithm. The TBAS has lower computational complexity than MMAS, but its speedup can vary from negligible to very significant, depending on the type of optimization problem, a way the algorithm is implemented and the parameter settings. Moreover, it is experimentally shown that TBAS algorithm is competitive with MMAS algorithm in means of solution quality, as it has achieved better results than MMAS on most of the tested instances of quadratic assignment problem (QAP).
Projekt / tema: 016-0361935-1728
Izvorni jezik: ENG
Rad je indeksiran u
bazama podataka:
Scopus
Kategorija: Znanstveni
Znanstvena područja:
Računarstvo
URL cjelovitog teksta:
Google Scholar: A New Ant Colony Optimization Algorithm : Three Bound Ant System
Upisao u CROSBI: Nikola Ivković (nivkovic@foi.hr), 2. Ruj. 2014. u 12:34 sati
Napomene:
Sažetak s kongresa? 2017-01-01, admin



Verzija za printanje   za tiskati


upomoc
foot_4