Grey Wolves Attack Process for the Pareto Optimal Front Construction in the Multiobjective Optimization
نویسندگان
چکیده
We propose a new metaheuristic, HmGWOGA-MO, for solving multiobjective optimization problems operating with population of solutions. The method is hybridization the HmGWOGA method, which single objective and ϵ-constraint approach, an aggregation technique. technique one best ways to transform problem many functions into because it works even if has any kind Pareto optimal front. Previously, was designed optimize positive single-objective function without constraints. obtained solutions are good. That why, in this current work, we combined have approach resolution problems. Our proceeds by transforming given constraints unconstrained function. With five different test varying fronts been successfully solved, results compared those NSGA-II regarding convergence towards front distribution on This numerical study indicates that HmGWOGA-MO choice when most important performance parameter.
منابع مشابه
Equispaced Pareto Front Construction for Constrained Multiobjective Optimization
We consider constrained biobjective optimization problems. One of the extant issues in this area is that of uniform sampling of the Pareto front. We utilize equispacing constraints on the vector of objective values, as discussed in a previous paper dealing with the unconstrained problem. We present a direct and a dual formulation based on arc-length homotopy continuation and illustrate the dire...
متن کاملSeeking the Pareto front for multiobjective spatial optimization problems
B. HUANG*?, P. FERYS, L. XUES and Y. WANGT[ ?Department of Geography and Resource Management, The Chinese University of Hong Kong, Shatin, NT, Hong Kong SDepartment of Civil Engineering, National University of Singapore, Singapore §Institute of Remote Sensing and Geographic Information Systems, Peking University, Beijing, PR China TInstitute of Geographical Sciences and Nature Resources Researc...
متن کاملPAINT: Pareto front interpolation for nonlinear multiobjective optimization
A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem...
متن کاملEquispaced Pareto front construction for constrained bi-objective optimization
We consider constrained biobjective optimization problems. One of the extant issues in this area is that of uniform sampling of the Pareto front. We utilize equispacing constraints on the vector of objective values, as discussed in a previous paper dealing with the unconstrained problem. We present a direct and a dual formulation based on arc-length homotopy continuation and illustrate the dire...
متن کاملA New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems
Here, scalarization techniques for multi-objective optimization problems are addressed. A new scalarization approach, called unified Pascoletti-Serafini approach, is utilized and a new algorithm to construct the Pareto front of a given bi-objective optimization problem is formulated. It is shown that we can restrict the parameters of the scalarized problem. The computed efficient points provide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2023
ISSN: ['1307-5543']
DOI: https://doi.org/10.29020/nybg.ejpam.v16i1.4638