Modelling the Pareto-optimal set using B-spline basis functions for continuous multi-objective optimization problems

In the past few years, multi-objective optimization algorithms have been extensively applied in several fields including engineering design problems. A major reason is the advancement of evolutionary multi-objective optimization (EMO) algorithms that are able to find a set of non-dominated points spread on the respective Pareto-optimal front in a single simulation. Besides just finding a set of Pareto-optimal solutions, one is often interested in capturing knowledge about the variation of variable values over the Pareto-optimal front. Recent innovization approaches for knowledge discovery from Pareto-optimal solutions remain as a major activity in this direction. In this article, a different data-fitting approach for continuous parameterization of the Pareto-optimal front is presented. Cubic B-spline basis functions are used for fitting the data returned by an EMO procedure in a continuous variable space. No prior knowledge about the order in the data is assumed. An automatic procedure for detecting gaps in the Pareto-optimal front is also implemented. The algorithm takes points returned by the EMO as input and returns the control points of the B-spline manifold representing the Pareto-optimal set. Results for several standard and engineering, bi-objective and tri-objective optimization problems demonstrate the usefulness of the proposed procedure.

[1]  W. Karush.  Minima of Functions of Several Variables with Inequalities as Side Conditions , 2014 .

[2]  Manish Verma,et al.  A Comparative Study of Various Clustering Algorithms in Data Mining , 2012 .

[3]  Nedal T. Ratrout.  Subtractive Clustering-Based K-means Technique for Determining Optimum Time-of-Day Breakpoints , 2011 .

[4]  Kalyanmoy Deb,et al.  Towards automating the discovery of certain innovative design principles through a clustering-based optimization technique , 2011 .

[5]  Yue Qi,et al.  Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming , 2010, Eur. J. Oper. Res..

[6]  Kalyanmoy Deb,et al.  Investigating EA solutions for approximate KKT conditions in smooth problems , 2010, GECCO '10.

[7]  Qingfu Zhang,et al.  Approximating the Set of Pareto-Optimal Solutions in Both the Decision and Objective Spaces by an Estimation of Distribution Algorithm , 2009, IEEE Transactions on Evolutionary Computation.

[8]  Kalyanmoy Deb,et al.  Local search based evolutionary multi-objective optimization algorithm for constrained and unconstrained problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[9]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[10]  Qingfu Zhang,et al.  This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 RM-MEDA: A Regularity Model-Based Multiobjective Estimation of , 2022 .

[11]  Michael E. Mortenson,et al.  Geometric Modeling , 2008, Encyclopedia of GIS.

[12]  Kalyanmoy Deb,et al.  Finding trade-off solutions close to KKT points using evolutionary multi-objective optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[13]  Qingfu Zhang,et al.  Combining Model-based and Genetics-based Offspring Generation for Multi-objective Optimization Using a Convergence Criterion , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[14]  Kalyanmoy Deb,et al.  Reference point based multi-objective optimization using evolutionary algorithms , 2006, GECCO.

[15]  Qingfu Zhang,et al.  A model-based evolutionary algorithm for bi-objective optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[16]  Dirk Thierens,et al.  The Naive MIDEA: A Baseline Multi-objective EA , 2005, EMO.

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

[18]  M. Dellnitz,et al.  Covering Pareto Sets by Multilevel Subdivision Techniques , 2005 .

[19]  Kevin Tucker,et al.  Response surface approximation of pareto optimal front in multi-objective optimization , 2004 .

[20]  Bernhard Sendhoff,et al.  Voronoi-based estimation of distribution algorithm for multi-objective optimization , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[21]  I. C. Parmee,et al.  Developments of the cluster oriented genetic algorithm (COGA) , 2004 .

[22]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[23]  Yaochu Jin,et al.  Connectedness, regularity and the success of local search in evolutionary multi-objective optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[24]  A new evolutionary technique for detecting Pareto continuous regions , 2003 .

[25]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

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

[27]  C. Hillermeier.  Nonlinear Multiobjective Optimization: A Generalized Homotopy Approach , 2001 .

[28]  Claus Hillermeier,et al.  Nonlinear Multiobjective Optimization , 2001 .

[29]  D. Dumitrescu,et al.  GENETIC CHROMODYNAMICS FOR OBTAINING CONTINUOUS REPRESENTATION OF PARETO REGIONS , 2001 .

[30]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[31]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[32]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[33]  S. Schaible,et al.  Connectedness of the Efficient Set for Three-Objective Quasiconcave Maximization Problems , 1997 .

[34]  M. Ehrgott,et al.  Connectedness of efficient solutions in multiple criteria combinatorial optimization , 1997 .

[35]  Achille Messac,et al.  Physical programming - Effective optimization for computational design , 1996 .

[36]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[37]  David C. Gossard,et al.  Multidimensional curve fitting to unorganized data points by nonlinear minimization , 1995, Comput. Aided Des..

[38]  Stephen L. Chiu,et al.  Fuzzy Model Identification Based on Cluster Estimation , 1994, J. Intell. Fuzzy Syst..

[39]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[40]  Ralph E. Steuer,et al.  An interactive weighted Tchebycheff procedure for multiple objective programming , 1983, Math. Program..

[41]  Andrzej P. Wierzbicki,et al.  The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[42]  A. Charnes,et al.  Goal programming and multiple objective optimizations: Part 1 , 1977 .

[43]  A. Charnes,et al.  EFFECTIVE CONTROL THROUGH COHERENT DECENTRALIZATION WITH PREEMPTIVE GOALS , 1967 .

[44]  Lotfi A. Zadeh,et al.  Optimality and non-scalar-valued performance criteria , 1963 .

[45]  T. L. Saaty,et al.  The computational algorithm for the parametric objective function , 1955 .

[46]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .