The Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems

author

Abstract:

In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be encountered that are ineffective in relation to each other. In order to find such NDPs, many methods including the scalarization techniques have been proposed, each with their advantages and disadvantages. A comprehensive approach with scalarization perspective is the PS method of Pascoletti and Serafini. The PS method uses the two parameters of  as the starting point and  as the direction of motion to find the NDPs on the 'non-dominate' frontier (NDF). In bi-objective cases, the point  is selected on a special line, and changing point on this line leads to finding all the NDPs. Generalization of this approach is very difficult to three- or more-criteria optimization problems because any closed pointed cone in a three- or more-dimensional space is not like a two-dimensional space of a polygonal cone. Moreover, even for multifaceted cones, the method cannot be generalized, and inevitably weaker constraints must be used in the assumptions of the method. In order to overcome such problems of the PS method, instead of a hyperplane (two-dimensional line), a hypersphere is applied in the current paper, and the parameter  is changed over its boundary. The generalization of the new method for more than two criteria problems is simply carried out, and the examples, provided along with their comparisons with methods such as mNBI and NC, ensure the efficiency of the method. A case study in the realm of health care management (HCM) including two conflicting CFs with special constraints is also presented as an exemplar application of the proposed method.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

An efficient improvement of the Newton method for solving nonconvex optimization problems

‎Newton method is one of the most famous numerical methods among the line search‎ ‎methods to minimize functions. ‎It is well known that the search direction and step length play important roles ‎in this class of methods to solve optimization problems. ‎In this investigation‎, ‎a new modification of the Newton method to solve ‎unconstrained optimization problems is presented‎. ‎The significant ...

full text

Pareto Tracer : A Predictor Corrector Method for Multi - objective Optimization Problems

In many real-world applications, the problem arises that several objectives have to be optimized concurrently leading to a multi-objective optimization problem. Since these goals are typically contradictory, it comes as no surprise that the solution set— the so-called Pareto set—of such problems does (in general) not consist of one single solution. Moreover, under some mild conditions, this set...

full text

PDE: A Pareto–frontier Differential Evolution Approach for Multi-objective Optimization Problems

The use of evolutionary algorithms (EAs) to solve problems with multiple objectives (known as Multi-objective Optimization Problems (MOPs)) has attracted much attention recently. Being population based approaches, EAs offer a means to find a group of pareto-optimal solutions in a single run. Differential Evolution (DE) is an EA that was developed to handle optimization problems over continuous ...

full text

Solution of Multi-Objective optimal reactive power dispatch using pareto optimality particle swarm optimization method

For multi-objective optimal reactive power dispatch (MORPD), a new approach is proposed where simultaneous minimization of the active power transmission loss, the bus voltage deviation and the voltage stability index of a power system are achieved. Optimal settings of continuous and discrete control variables (e.g. generator voltages, tap positions of tap changing transformers and the number of...

full text

An effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems

The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 12  issue 3

pages  379- 404

publication date 2019-09-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023