An Approach of Constructing Multi-Objective Pareto Optimal Solutions Using Arena's Principle
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    This paper proposes an approach, namely the arena’s principle (AP), to construct the Pareto optimal solutions by utilizing features of the multi-objective evolution. It is proved that the AP works correctly and its computational complexity is O(rmN) (0<1). Theoretically, when AP is compared with Deb’s algorithm and Jensen’s algorithm (their computational complexity are O(rN2) and O(Nlog(r-1)N) respectively), AP is better than Deb’s, and is also better than Jensen’s when the objective number r is relatively large (such as r≥5). Moreover, AP performs better than the other two algorithms when m/N is relatively small (such as m/N≤50%). Experimental results indicate that AP performs better than the other two algorithms on the CPU time efficiency. In applications, AP can be integrated into any Pareto-based MOEA to improve its running efficiency.

    Reference
    Related
    Cited by
Get Citation

郑金华,蒋浩,邝达,史忠植.用擂台赛法则构造多目标Pareto最优解集的方法.软件学报,2007,18(6):1287-1297

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 05,2006
  • Revised:August 18,2006
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063