Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/860
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electrical Engineering-
dc.contributorIndustrial Centre-
dc.creatorHo, SL-
dc.creatorYang, S-
dc.creatorWong, HCC-
dc.creatorCheng, KWE-
dc.creatorNi, G-
dc.date.accessioned2014-12-11T08:28:13Z-
dc.date.available2014-12-11T08:28:13Z-
dc.identifier.issn0018-9464-
dc.identifier.urihttp://hdl.handle.net/10397/860-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_US
dc.rightsThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en_US
dc.subjectAnt colony optimization (ACO) methoden_US
dc.subjectHeuristic algorithmen_US
dc.subjectInverse problemen_US
dc.subjectOptimal designen_US
dc.subjectElectromagnetic field effectsen_US
dc.subjectElectronic equipmenten_US
dc.subjectFood productsen_US
dc.subjectGlobal optimizationen_US
dc.subjectInverse problemsen_US
dc.subjectLiving systems studiesen_US
dc.subjectProblem solvingen_US
dc.subjectSimulated annealingen_US
dc.subjectGenetic algorithmsen_US
dc.titleAn improved ant colony optimization algorithm and its application to electromagnetic devices designsen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: S. L. Hoen_US
dc.description.otherinformationAuthor name used in this publication: H. C. Wongen_US
dc.description.otherinformationAuthor name used in this publication: K. W. E. Chengen_US
dc.identifier.spage1764-
dc.identifier.epage1767-
dc.identifier.volume41-
dc.identifier.issue5-
dc.identifier.doi10.1109/TMAG.2005.845998-
dcterms.abstractBased 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE transactions on magnetics, May 2005, v. 41, no. 5, p. 1764-1767-
dcterms.isPartOfIEEE transactions on magnetics-
dcterms.issued2005-05-
dc.identifier.isiWOS:000229084200103-
dc.identifier.scopus2-s2.0-22044453555-
dc.identifier.eissn1941-0069-
dc.identifier.rosgroupidr21990-
dc.description.ros2004-2005 > Academic research: refereed > Publication in refereed journal-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
ant-colony-optimization_05.pdf143.94 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

279
Last Week
2
Last month
Citations as of Mar 24, 2024

Downloads

455
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

35
Last Week
0
Last month
0
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

22
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.