A particle gradient evolutionary algorithm for solving multi-obective problems

doi:10.1016/j.amc.2006.09.010

A particle gradient evolutionary algorithm for solving multi-obective problems

2007-04-01

2

PRE

AI

DOI：10.1016/j.amc.2006.09.010

原文链接

原文求助

摘要

En 中文

In this paper a particle gradient evolutionary algorithm (PGEA) for solving complex multi-objective optimization problems is presented according to the gradient of particles, the transportation orbit of particles, the minimum principle of free energy decreasing, and the law of entropy increasing of particle systems in the phase space based on a transportation theory. This algorithm includes two sub-algorithms: the first is to define the PGEA energy and entropy, a rank function, and a niche function and then calculate the rank function values of every particle in the phase space; the second is to solve for the optimal Pareto front of a multi-objective optimization problem. The theory of a particle system changing from non-equilibrium to equilibrium is used to design tile algorithm in order to drive all the individuals in the population to have a chance to participate in the evolving operation to obtain the Pareto optimal solutions of the multi-objective problems quickly and evenly. Our experiments show that this algorithm cannot only converge to the global Pareto optimal front quickly, uniformly, and precisely, but also can avoid the premature phenomenon of multi-objective problems. (c) 2006 Elsevier Inc. All rights reserved.

Keyword:

evolutionary computation

particle gradient

free energy

entropy

A particle gradient evolutionary algorithm for solving multi-obective problems

摘要

期刊

机构

引用论文