A Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems

Diversity maintenance of solutions is an essential part in multi-objective optimization. Existing techniques are suboptimal either in the sense of obtained distribution or execution time. This paper proposes an effective and relatively fast method for pruning a set of non-dominated solutions. The proposed method is based on a crowding estimation technique using nearest neighbors of solutions in Euclidean sense, and a technique for finding these nearest neighbors quickly. The method is experimentally evaluated, and results indicate a good trade-off between the obtained distribution and execution time. Distribution is good also in many-objective problems, when number of objectives is more than two.

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

[2]  Mikkel T. Jensen,et al.  Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms , 2003, IEEE Trans. Evol. Comput..

[3]  Jeng-Shyang Pan,et al.  An efficient encoding algorithm for vector quantization based on subvector technique , 2003, IEEE Trans. Image Process..

[4]  Lakhmi C. Jain,et al.  Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[5]  Koeng-Mo Sung,et al.  Fast k-nearest-neighbour search algorithm for nonparametric classification , 2000 .

[6]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[7]  Xiaodong Li,et al.  Solving Rotated Multi-objective Optimization Problems Using Differential Evolution , 2004, Australian Conference on Artificial Intelligence.

[8]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

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

[10]  Robert M. Gray,et al.  An Improvement of the Minimum Distortion Encoding Algorithm for Vector Quantization , 1985, IEEE Trans. Commun..

[11]  Pasi Fränti,et al.  Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  S. Florin Beldianu.  A fast nearest neighbor search algorithm for image vector quantization , 2005, International Symposium on Signals, Circuits and Systems, 2005. ISSCS 2005..

[13]  Mohamed S. Kamel,et al.  Equal-average hyperplane partitioning method for vector quantization of image data , 1992, Pattern Recognit. Lett..

[14]  Graham Kendall,et al.  Handling diversity in evolutionary multiobjective optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[15]  Kalyanmoy Deb,et al.  Improved Pruning of Non-Dominated Solutions Based on Crowding Distance for Bi-Objective Optimization Problems , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[16]  Xinghuo Yu,et al.  AI 2004: Advances in Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence, Cairns, Australia, December 4-6, 2004, Proceedings , 2004, Australian Conference on Artificial Intelligence.

[17]  Koeng-Mo Sung,et al.  A fast encoding algorithm for vector quantization , 1997, IEEE Signal Processing Letters.

[18]  Pravin M. Vaidya,et al.  AnO(n logn) algorithm for the all-nearest-neighbors Problem , 1989, Discret. Comput. Geom..

[19]  Jouni Lampinen,et al.  GDE3: the third evolution step of generalized differential evolution , 2005, 2005 IEEE Congress on Evolutionary Computation.

[20]  S. Ra,et al.  A fast mean-distance-ordered partial codebook search algorithm for image vector quantization , 1993 .