Volume 25, Number 1 (7-2006)                   JCME 2006, 25(1): 33-45 | Back to browse issues page


XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

M. Eftekhari, B. Daei, and S. D. Katebi. Gradient-based Ant Colony Optimization for Continuous Spaces. JCME. 2006; 25 (1) :33-45
URL: http://jcme.iut.ac.ir/article-1-374-en.html

Abstract:   (1289 Views)
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vectors which are memorized. These vectors are normalized gradient vectors that are calculated using the values of the evaluation function and the corresponding values of object variables. The proposed Gradient-based Continuous Ant Colony Optimization (GCACO) method is applied to several benchmark problems and the results are compared and contrasted with other population-based algorithms such as Evolutionary Strategies (ES), Evolutionary Programming (EP), and Genetic Algorithms (GA). The results obtained from GCACO compare satisfactorily with those of other algorithms and in some cases are superior in terms of accuracy and computational demand.
Full-Text [PDF 417 kb]   (140 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25

Add your comments about this article : Your username or email:
Write the security code in the box

© 2015 All Rights Reserved | Computational Methods in Engineering

Designed & Developed by : Yektaweb