An improvement of the ant algorithm for the maximum clique problem
cytuj
pobierz pliki
RIS BIB ENDNOTEChoose format
RIS BIB ENDNOTEAn improvement of the ant algorithm for the maximum clique problem
Publication date: 08.02.2016
Technical Transactions, 2015, Electronical Engineering Issue 2-E (13) 2015, pp. 225 - 233
https://doi.org/10.4467/2353737XCT.15.098.3930Authors
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.
Information: Technical Transactions, 2015, Electronical Engineering Issue 2-E (13) 2015, pp. 225 - 233
Article type: Original article
Titles:
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
Published at: 08.02.2016
Article status: Open
Licence: None
Percentage share of authors:
Article corrections:
-Publication languages:
EnglishView count: 1558
Number of downloads: 1009