Non-dominated sorting simplex algorithm for multi-objective optimization

摘要：

TraCtional multi-objective optimization algorithms like NSGA/NSGA-II and NSDE employ non-dominated sorting to locate the Pareto solutions. Their global convergence character guarantee the quality of solutions, yet the searching speed impedes vast usage in complex engineering problems. In order to deal with this situation, a novel simplex algorithm employing non-dominated sorting strategy, NS-Simplex, is proposed. Its non-dominated sorting strategy ensures the generation of Pareto fronts, whereas the simplex procedure accelerates the convergence process. Benchmark problems are used in numerical experiments to evaluate the performance of NS-Simplex and the numerical result illustrates the effectiveness and efficiency of NS-Simplex.

关键词： Non-dominated sorting NS-Simplex Simplex algorithm

作者: Surong Ruan Wenhui Fan Zhenxiao Gao Jinbiao Lin Rong Xin Zuozhi Zhao

作者单位: Dept.of Automation, Tsinghua University Beijing, 100084, China Siemens Ltd., China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 457-461

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）