Show simple item record

dc.contributor.authorJiang, Shouyongen
dc.contributor.authorYang, Shengxiangen
dc.date.accessioned2016-04-06T09:22:02Z
dc.date.available2016-04-06T09:22:02Z
dc.date.issued2015-09
dc.identifier.citationJiang, S. and Yang, S. (2015) A fast strength pareto evolutionary algorithm incorporating predefined preference information. Proceedings of the 15th UK Workshop on Computational Intelligence, pp. 1-8, 2015en
dc.identifier.urihttp://hdl.handle.net/2086/11818
dc.description.abstractStrength Pareto Evolutionary Algorithm 2 (SPEA2) has achieved great success for handling multiobjective optimization problems. However, it has been widely reported that SPEA2 gets subjected to a huge amount of computational effort while pursuing a good distribution of approximated solutions. This paper explores a new way to keep the good properties of SPEA2 and reduce its high computational burden simultaneously, with the aid of predefined preference information. By incorporating preference information, the proposed fast SPEA (FSPEA) can efficiently perform individuals' density estimation and environmental selection, thus speeding up the whole running time of the evolution process. Empirical studies show that the proposed FSPEA algorithm can obtain very competitive performance on a number of multiobjective test problems considered in this paper.en
dc.language.isoen_USen
dc.publisherIEEE Pressen
dc.subjectmultiobjective optimiza- tion problemen
dc.titleA Fast Strength Pareto Evolutionary Algorithm Incorporating Predefined Preference Informationen
dc.typeConferenceen
dc.researchgroupCentre for Computational Intelligenceen
dc.peerreviewedYesen
dc.explorer.multimediaNoen
dc.funderEPSRC (Engineering and Physical Sciences Research Council)en
dc.projectidEP/K001310/1en
dc.cclicenceCC-BY-NCen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record