A Multi-objective Genetic Algorithm Bas on Individual Density Distance

The uniform and extension distribution of the optimal solution are very important criterion for the quality evaluation of the multi-objective programming problem. A genetic algorithm based on agent and individual density is used to solve the multi-objective optimization problem. In the selection process, each agent is selected according to the individual density distance in its neighborhood, and the crossover operator adopts the simulated binary crossover method. The self-learning behavior only applies to the individuals with the highest energy in current population. A few classical multi-objective function optimization examples were used tested and two evaluation indexes U-measure and S-measure are used to test the performance of the algorithm. The experimental results show that the algorithm can obtain uniformity and widespread distribution Pareto solutions.