Supported by the National Natural Science Foundation of China(60204001,70071042,60073043,60133010)and Youth Chengguang Project of Science and Technology of Wuhan City(20025001002)
A fast algorithm is proposed to solve a kind of high complexity multi-objective problems in this paper. It takes advantages of both the orthogonal design method to search evenly, and the statistical optimal method to ...
Supported by the National Natural Science Foundation of China(70071042,60073043,60133010)
We present a new definition (Evolving Solutions) for Multi-objective Optimization Problem (MOP) to answer the basic question (what's multi-objective optimal solution?) and advance an asynchronous evolutionary model (M...
Supported by the National Natural Science Foundation of China(60133010,70071042,60073043)
Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search an...
Supported by the National Natural Science Foundation of China (6013301,60073043,70071042)
Multi-objective optimization is a new focus of evolutionary computation research. This paper puts forward a new algorithm, which can not only converge quickly, but also keep diversity among population efficiently, in ...
Supported by the National Natural Science Foundation of China(60073043,70071042,60133010)
Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has so...