论文信息 - A Multi-objective Genetic Algorithm Based on Quick Sort

A Multi-objective Genetic Algorithm Based on Quick Sort

The Multi-objective Genetic Algorithms (MOGA) based on Pareto Optimum have been widely applied to solve multi-objective optimal problems, mainly because of their ability to find a set of candidate solutions within a single run. In MOGAs, a non-dominated set is a set of candidate solutions, so it is very important to construct the non-dominated set efficiently. In this paper, the relation of individuals and their related features are discussed. It is proved that the individuals of an evolutionary population can be sorted by quick sort. We construct the non-dominated set of the evolutionary population with quick sort, and the time complexity of the construction is O(nlog n), compared to the previous best result of O(n 2) described in the popular NSGA-II [Deb, 2002]. We further propose a multi-objective genetic algorithm based on quick sort, and two benchmark problems are experimented. We show that the results of the experiments match to our theoretical analysis.

[1] Kalyanmoy Deb,et al. Towards a Quick Computation of Well-Spread Pareto-Optimal Solutions , 2003, EMO.

[2] Zbigniew Michalewicz,et al. Evolutionary Computation 2 , 2000 .

[3] Kalyanmoy Deb,et al. Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[4] Kalyanmoy Deb,et al. A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[5] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[6] Peter J. Fleming,et al. Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[7] Kalyanmoy Deb,et al. A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[8] Marco Laumanns,et al. SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[9] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[10] David E. Goldberg,et al. A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .