A Time Complexity Analysis of ACO for Linear Functions

The time complexity analysis of ant colony optimization (ACO) is one of the open problems in ACO research. There has been little proposed work on this topic recently. In the present paper, two ACO algorithms (ACO I and ACO II) for linear functions with Boolean input are indicated, and their time com...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Hao, Zhifeng, Huang, Han, Zhang, Xili, Tu, Kun
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!