Performance of aggregation pheromone system on unimodal and multimodal problems

This paper describes and analyzes the aggregation pheromone system (APS) algorithm, which extends ant colony optimization (ACO) to continuous domains. APS uses the collective behavior of individuals that communicate using aggregation of pheromones. Two variants of APS are considered: the existing generational APS and the proposed steadystate APS. Both variants of APS are tested on several common unimodal and multimodal problems and their performance on these problems is analyzed with different parameter settings. The results indicate that using a steady-state evolutionary model improves the performance of APS on both unimodal as well as multimodal problems and that the performance of APS is relatively robust with respect to its parameter settings.

• Type: Conference
• Year: 2005
• Where: CEC
• Authors: Shigeyoshi Tsutsui, Martin Pelikan, Ashish Ghosh
• Keywords: Artificial Intelligence, CEC 2005, Generational Aps, Multimodal Problems, Steadystate Aps