Computation of multiple global optima through chaotic ant swarm

Lixiang Li, Yixian Yang and Haipeng Peng

Chaos, Solitons & Fractals, 2009, vol. 40, issue 3, 1399-1407

Abstract: This paper proposes a technique aiming to compute all global minimizers, while avoiding local minimizers, through chaotic ant swarm (CAS) optimization method. This technique incorporates the recently proposed deflection and repulsion techniques to alleviate local minimizers. Those approaches can be used in combination with CAS to detect all global minimizers effectively. The performance of the algorithm is illustrated on test problems of global optimization. Experimental results indicate the effectiveness of the proposed algorithm.

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S096007790700759X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:40:y:2009:i:3:p:1399-1407

DOI: 10.1016/j.chaos.2007.09.024

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().