An improvement of the ant algorithm for the maximum clique problem
cytuj
pobierz pliki
RIS BIB ENDNOTEWybierz format
RIS BIB ENDNOTEAn improvement of the ant algorithm for the maximum clique problem
Data publikacji: 08.02.2016
Czasopismo Techniczne, 2015, Elektrotechnika Zeszyt 2-E (13) 2015, s. 225 - 233
https://doi.org/10.4467/2353737XCT.15.098.3930Autorzy
An improvement of the ant algorithm for the maximum clique problem
The maximum clique problem is a very well-known NP-complete problem and for such a problem, meta-heuristic algorithms have been developed which ant algorithms belongs to. There are many algorithms including ant algorithms that have been elaborated for this problem. In this paper, a new dynamic function of selecting with a new improvement procedure in order to get a larger size of clique for the ant algorithm is presented and this search for the maximum clique in graph is compared to the bestn ant algorithms that are already known.
Informacje: Czasopismo Techniczne, 2015, Elektrotechnika Zeszyt 2-E (13) 2015, s. 225 - 233
Typ artykułu: Oryginalny artykuł naukowy
Tytuły:
An improvement of the ant algorithm for the maximum clique problem
An improvement of the ant algorithm for the maximum clique problem
Department of Automatic Control and Information Technology, Faculty of Electrical and Computer Engineering, Cracow University of Technology
Publikacja: 08.02.2016
Status artykułu: Otwarte
Licencja: Żadna
Udział procentowy autorów:
Korekty artykułu:
-Języki publikacji:
AngielskiLiczba wyświetleń: 1562
Liczba pobrań: 1010