Please submit manuscripts in either of the following two submission systems

    ScholarOne Manuscripts

  • ScholarOne
  • 勤云稿件系统

  • 登录

Search by Issue

  • 2024 Vol.31
  • 2023 Vol.30
  • 2022 Vol.29
  • 2021 Vol.28
  • 2020 Vol.27
  • 2019 Vol.26
  • 2018 Vol.25
  • 2017 Vol.24
  • 2016 vol.23
  • 2015 vol.22
  • 2014 vol.21
  • 2013 vol.20
  • 2012 vol.19
  • 2011 vol.18
  • 2010 vol.17
  • 2009 vol.16
  • No.1
  • No.2

Supervised by Ministry of Industry and Information Technology of The People's Republic of China Sponsored by Harbin Institute of Technology Editor-in-chief Yu Zhou ISSNISSN 1005-9113 CNCN 23-1378/T

期刊网站二维码
微信公众号二维码
Related citation:Dalaijargal Purevsuren,Saif ur Rehman,Gang Cui,Jianmin Bao,Nwe Nwe Htay Win.Interactive Evolutionary Multi-Objective Optimization Algorithm Using Cone Dominance[J].Journal of Harbin Institute Of Technology(New Series),2015,22(6):76-84.DOI:10.11916/j.issn.1005-9113.2015.06.011.
【Print】   【HTML】   【PDF download】   View/Add Comment  Download reader   Close
←Previous|Next→ Back Issue    Advanced Search
This paper has been: browsed 1324times   downloaded 1047times 本文二维码信息
码上扫一扫!
Shared by: Wechat More
Interactive Evolutionary Multi-Objective Optimization Algorithm Using Cone Dominance
Author NameAffiliation
Dalaijargal Purevsuren School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China 
Saif ur Rehman School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China 
Gang Cui School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China 
Jianmin Bao Key Lab of Broadband Wireless Communication and Sensor Network Technology Jiangsu Provincial Engineering Research Center of Telecommunications and Network Technology, Ministry of Education, Nanjing 210003, China 
Nwe Nwe Htay Win School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China 
Abstract:
As the number of objectives increases, the performance of the Pareto dominance-based Evolutionary Multi-objective Optimization (EMO) algorithms such as NSGA-II, SPEA2 severely deteriorates due to the drastic increase in the Pareto-incomparable solutions. We propose a sorting method which classifies these incomparable solutions into several ordered classes by using the decision maker''s (DM) preference information. This is accomplished by designing an interactive evolutionary algorithm and constructing convex cones. This method allows the DMs to drive the search process toward a preferred region of the Pareto optimal front. The performance of the proposed algorithm is assessed for two, three, and four-objective knapsack problems. The results demonstrate the algorithm''s ability to converge to the most preferred point. The evaluation and comparison of the results indicate that the proposed approach gives better solutions than that of NSGA-II. In addition, the approach is more efficient compared to NSGA-II in terms of the number of generations required to reach the preferred point.
Key words:  multi-objective optimization  evolutionary optimization  preference information  pareto dominance  cone dominance
DOI:10.11916/j.issn.1005-9113.2015.06.011
Clc Number:TP3
Fund:

LINKS