An ant colony algorithm for both robust and global optimizations of inverse problems

Siu Lau Ho, Shiyou Yang, Yanan Bai, J. Huang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

7 Citations (Scopus)

Abstract

To address the computational inefficiencies of available robust oriented optimizers, a fast optimal algorithm based on ant colony optimization (ACO) algorithm for both robust and global optimizations of inverse problems is proposed. In the proposed algorithm, the structures of the algorithm are redesigned, and methodologies for efficient computations of the robust performance parameters are proposed. Numerical results are reported to positively showcase the merits of the proposed algorithm.
Original languageEnglish
Article number6514690
Pages (from-to)2077-2080
Number of pages4
JournalIEEE Transactions on Magnetics
Volume49
Issue number5
DOIs
Publication statusPublished - 22 May 2013

Keywords

  • Ant colony algorithm
  • inverse problem
  • optimization
  • robust design

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this