用擂台赛法则构造多目标pareto最优解集的方法-软件学报.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.18, No.6, June 2007, pp .1287−1297 http://www.j DOI: 10. 1360/jos1 81287 Tel/Fax : +86-10 © 2007 by Journal of Software. All rights reserved. ∗ 用擂台赛法则构造多目标Pareto 最优解集的方法 1+ 1 1 2 郑金华 , 蒋 浩 , 邝 达 , 史忠植 1(湘潭大学 信息工程学院,湖南 湘潭 411105) 2( 中国科学院 计算技术研究所,北京 100080) An Approach of Constructing Multi-Objective Pareto Optimal Solutions Using Arena’s Principle 1+ 1 1 2 ZHENG Jin-Hua , JIANG Hao , KUANG Da , SHI Zhong-Zhi 1(Institute of Information Engineering, Xiangtan University, Xiangtan 411105, China) 2(Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100080, China) + Corresponding author: Phn: +86-732-8293457, E-mail: jhzheng@, Zheng JH, Jiang H, Kuang D, Shi ZZ. An Approach of Constructing Multi-Objective Pareto Optimal Solutions Using Arena’s Principle. Journal of Soft ware, 2007,18(6):1287−1297. http ://.c n/1000- 9825/ 18/ 1287.htm 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) (0m/N 1). Theoretically, when AP is compared with Deb’s algorithm and Jensen’s algorithm (their computational complexity