A New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems
Authors
Abstract:
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 a nearly equidistant approximation of the whole Pareto front. The performance of the proposed algorithm is illustrated by various test problems and its effectiveness with respect to some existing methods is shown.
similar resources
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...
full textsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A Support-Based Algorithm for the Bi-Objective Pareto Constraint
Bi-Objective Combinatorial Optimization problems are ubiquitous in real-world applications and designing approaches to solve them efficiently is an important research area of Artificial Intelligence. In Constraint Programming, the recently introduced bi-objective Pareto constraint allows one to solve bi-objective combinatorial optimization problems exactly. Using this constraint, every non-domi...
full textPareto front of bi-objective kernel-based nonnegative matrix factorization
The nonnegative matrix factorization (NMF) is a powerful data analysis and dimensionality reduction technique. So far, the NMF has been limited to a single-objective problem in either its linear or nonlinear kernel-based formulation. This paper presents a novel bi-objective NMF model based on kernel machines, where the decomposition is performed simultaneously in both input and feature spaces. ...
full textAdaptive weighted-sum method for bi-objective optimization: Pareto front generation
This paper presents a new method that effectively determines a Pareto front for bi-objective optimization with potential application to multiple objectives. A traditional method for multiobjective optimization is the weighted-sum method, which seeks Pareto optimal solutions one by one by systematically changing the weights among the objective functions. Previous research has shown that this met...
full textPDE-PEDA: A New Pareto-Based Multi-objective Optimization Algorithm
Differential evolution (DE) algorithm puts emphasis particularly on imitating the microscopic behavior of individuals, while estimation of distribution algorithm (EDA) tries to estimate the probabilistic distribution of the entire population. DE and EDA can be extended to multi-objective optimization problems by using a Pareto-based approach, called Pareto DE (PDE) and Pareto EDA (PEDA) respect...
full textMy Resources
Journal title
volume 10 issue None
pages 49- 61
publication date 2019-09
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023