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 speed up the computation. It is very suitable for solving high complexity problems, and quickly yields solutions which converge to the Pareto-optimal set with high precision and uniform distribution. Some complicated multi-objective problems are solved by the algorithm and the results show that the algorithm is not only fast but also superior to other MOGAS and MOEAs, such as the currently efficient algorithm SPEA, in terms of the precision, quantity and distribution of solutions.
Zeng San-you, Ding Li-xin, Kang Li-shanDepartment of Computer Science,China University of GeoSciences, Wuhan 430074, Hubei, China
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 (MINT Model) to solve MOPs. The new theory is based on our understanding of the natural evolution and the analysis of the difference between natural evolution and MOP, thus it is not only different from the Converting Optimization but also different from Pareto Optimization. Some tests prove that our new theory may conquer disadvantages of the upper two methods to some extent.
Zhou Ai-min, Kang Li-shan, Chen Yu-ping, Huang Yu-zhenState Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, Hubei, China
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 and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators.
Yan Zhen-yu, Kang Li-shan, Lin Guang-ming ,He MeiState Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, Hubei, ChinaSchool of Computer Science, UC, UNSW Australian Defence Force Academy, Northcott Drive, Canberra, ACT 2600 AustraliaCapital Bridge Securities Co. ,Ltd, Floor 42, Jinmao Tower, Shanghai 200030, China
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 order to find the Pareto-optimal set. This new algorithm replaces the worst individual with a newly-created one by 'multi-parent crossover' , so that the population could converge near the true Pareto-optimal solutions in the end. At the same time, this new algorithm adopts niching and fitness-sharing techniques to keep the population in a good distribution. Numerical experiments show that the algorithm is rather effective in solving some Benchmarks. No matter whether the Pareto front of problems is convex or non-convex, continuous or discontinuous, and the problems are with constraints or not, the program turns out to do well.
D Chen Wen-ping, Kang Li-shanState Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, Hubei, China
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 some shortcoming s, in this paper, we proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can reach the Pare-to front, retain the diversity of the population, and use less time.
Shi Chuan, Kang Li-shan, Li Yan, Yan Zhen-yuState Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, Hubei,China
