A Method for Selecting Pareto Optimal Solutions in Multiobjective Optimization

In many real-life multiobjective optimization problems and particularly in combinatorial ones, a common methodology is to determine a Pareto optimal set. These sets can be extremely large or may contain an infinite number of solutions. It is then difficult to choose among these solutions, one that corresponds to the best compromise according to the decision-maker's preferences. In this paper, we propose a model to select a restricted set of solutions. These sets should be structurally different and the most representative of the Pareto-optimal solutions. Our model is implemented using hierarchical algorithms and variable neighborhood search metaheuristics.

[1]  Shokri Z. Selim,et al.  A simulated annealing algorithm for the clustering problem , 1991, Pattern Recognit..

[2]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[3]  S. C. Johnson Hierarchical clustering schemes , 1967, Psychometrika.

[4]  Omid Omidvar,et al.  Neural Networks and Pattern Recognition , 1997 .

[5]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  M. Narasimha Murty,et al.  Clustering with evolution strategies , 1994, Pattern Recognit..

[7]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[8]  Anil K. Jain,et al.  Neural networks and pattern recognition , 1994 .

[9]  Ralph L. Keeney,et al.  Decisions with multiple objectives: preferences and value tradeoffs , 1976 .

[10]  David W. Coit,et al.  Practical solutions for multi-objective optimization: An application to system reliability design problems , 2007, Reliab. Eng. Syst. Saf..

[11]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[12]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[14]  Behnam Malakooti,et al.  Clustering and group selection of multiple criteria alternatives with application to space-based networks , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[15]  Keinosuke Fukunaga,et al.  A Branch and Bound Clustering Algorithm , 1975, IEEE Transactions on Computers.

[16]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[17]  Behnam Malakooti,et al.  Clustering and selection of multiple criteria alternatives using unsupervised and supervised neural networks , 2000, J. Intell. Manuf..