Abstract
Based on the success in the design of a new global search procedure on the development of a novel trail updating mechanism and the introduction of an elitist strategy to available ant colony optimization (AGO) methods, an improved AGO algorithm is proposed. In order to facilitate the implementation of the search procedure, the available local search phase is simplified also. The algorithm is tested on a mathematical function and an inverse problem, and its performances are compared with those of other well designed methods.
Original language | English |
---|---|
Pages (from-to) | 1764-1767 |
Number of pages | 4 |
Journal | IEEE Transactions on Magnetics |
Volume | 41 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1 May 2005 |
Keywords
- Ant colony optimization (ACO) method
- Heuristic algorithm
- Inverse problem
- Optimal design
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Electrical and Electronic Engineering