Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/863
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.creatorNi, G-
dc.creatorWong, HCC-
dc.date.accessioned2014-12-11T08:25:20Z-
dc.date.available2014-12-11T08:25:20Z-
dc.identifier.issn0018-9464-
dc.identifier.urihttp://hdl.handle.net/10397/863-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2002 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.subjectFitness sharingen_US
dc.subjectMultiobjective optimizationen_US
dc.subjectRankingen_US
dc.subjectTabu searchen_US
dc.subjectVector optimizationen_US
dc.titleA tabu method to find the Pareto solutions of multiobjective optimal design problems in electromagneticsen_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.identifier.spage1013-
dc.identifier.epage1016-
dc.identifier.volume38-
dc.identifier.issue2-
dc.identifier.doi10.1109/20.996260-
dcterms.abstractA tabu search algorithm is proposed for finding the Pareto solutions of multiobjective optimal design problems. In this paper, the contact theorem is used to evaluate the Pareto solutions. The ranking selecting approach and the fitness sharing function are also introduced to identify new current points to begin every iteration cycle. Detailed numerical results are reported in this paper to demonstrate the power of the proposed algorithm in ensuring uniform sampling and obtaining the Pareto optimal front of the multiobjective design problems. The most efficient method of implementing the proposed algorithm is also discussed.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE transactions on magnetics, Mar. 2002, v. 38, no. 2, p. 1013-1016-
dcterms.isPartOfIEEE transactions on magnetics-
dcterms.issued2002-03-
dc.identifier.isiWOS:000175086800175-
dc.identifier.scopus2-s2.0-0036493498-
dc.identifier.eissn1941-0069-
dc.identifier.rosgroupidr09309-
dc.description.ros2001-2002 > 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 
pareto-solutions_02.pdf61.29 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

104
Last Week
2
Last month
Citations as of Jul 3, 2022

Downloads

144
Citations as of Jul 3, 2022

SCOPUSTM   
Citations

24
Last Week
0
Last month
0
Citations as of Jul 7, 2022

WEB OF SCIENCETM
Citations

20
Last Week
0
Last month
0
Citations as of Jul 7, 2022

Google ScholarTM

Check

Altmetric


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