scholarly journals A New Approach to Group Multi-Objective Optimization under Imperfect Information and Its Application to Project Portfolio Optimization

2021 ◽  
Vol 11 (10) ◽  
pp. 4575
Author(s):  
Eduardo Fernández ◽  
Nelson Rangel-Valdez ◽  
Laura Cruz-Reyes ◽  
Claudia Gomez-Santillan
Keyword(s):  
Portfolio Optimization ◽  
Imperfect Information ◽  
Model Parameters ◽  
Final Decision ◽  
Project Portfolio ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
New Approach ◽  
Multi Objective ◽  
Group Member

This paper addresses group multi-objective optimization under a new perspective. For each point in the feasible decision set, satisfaction or dissatisfaction from each group member is determined by a multi-criteria ordinal classification approach, based on comparing solutions with a limiting boundary between classes “unsatisfactory” and “satisfactory”. The whole group satisfaction can be maximized, finding solutions as close as possible to the ideal consensus. The group moderator is in charge of making the final decision, finding the best compromise between the collective satisfaction and dissatisfaction. Imperfect information on values of objective functions, required and available resources, and decision model parameters are handled by using interval numbers. Two different kinds of multi-criteria decision models are considered: (i) an interval outranking approach and (ii) an interval weighted-sum value function. The proposal is more general than other approaches to group multi-objective optimization since (a) some (even all) objective values may be not the same for different DMs; (b) each group member may consider their own set of objective functions and constraints; (c) objective values may be imprecise or uncertain; (d) imperfect information on resources availability and requirements may be handled; (e) each group member may have their own perception about the availability of resources and the requirement of resources per activity. An important application of the new approach is collective multi-objective project portfolio optimization. This is illustrated by solving a real size group many-objective project portfolio optimization problem using evolutionary computation tools.

Design Improvement by Sensitivity Analysis (DISA) Under Interval Uncertainty Using Multi-Objective Optimization

2009 ◽  
Author(s):  
J. Hamel ◽  
M. Li ◽  
S. Azarm
Keyword(s):  
Sensitivity Analysis ◽  
Interval Uncertainty ◽  
Minimal Amount ◽  
Engineering System ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
New Approach ◽  
Design Improvement ◽  
Multi Objective ◽  
System A

Uncertainty in the input parameters to an engineering system may not only degrade the system’s performance, but may also cause failure or infeasibility. This paper presents a new sensitivity analysis based approach called Design Improvement by Sensitivity Analysis (DISA). DISA analyzes the interval parameter uncertainty of a system and, using multi-objective optimization, determines an optimal combination of design improvements required to enhance performance and ensure feasibility. This is accomplished by providing a designer with options for both uncertainty reduction and, more importantly, slight design adjustments. The approach can provide improvements to a design of interest that will ensure a minimal amount of variation in the objective functions of the system while also ensuring the engineering feasibility of the system. A two stage sequential framework is used in order to effectively employ metamodeling techniques to approximate the analysis function of an engineering system and greatly increase the computational efficiency of the approach. This new approach has been applied to two engineering examples of varying difficulty to demonstrate its applicability and effectiveness.

An Interval-Based Approach for Evolutionary Multi-Objective Optimization of Project Portfolios

2019 ◽  
Vol 18 (04) ◽  
pp. 1317-1358 ◽  
Author(s):  
Fausto Balderas ◽  
Eduardo Fernandez ◽  
Claudia Gomez-Santillan ◽  
Nelson Rangel-Valdez ◽  
Laura Cruz
Keyword(s):  
Optimization Problem ◽  
Pareto Frontier ◽  
Region Of Interest ◽  
Project Portfolio ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Public Project ◽  
Multi Objective ◽  
Imperfect Knowledge ◽  
Project Portfolios

Project portfolio selection is addressed here as a multi-objective optimization problem. This work introduces an interval-based method that takes into consideration imperfect knowledge of the contribution of projects to a portfolio, the project requirements, available resources and preference parameters in the model. The multi-objective optimization problem is solved using an evolutionary algorithm that is adapted to handle intervals. To direct the search toward the region of interest of the Pareto frontier, the preferences of the decision maker (DM) are incorporated using an interval-based outranking approach. This allows to address problems with many objective functions; intransitive preferences and incomparability situations can also be handled using this approach. In terms of analyzing robustness, the DM can obtain different solutions according to his/her level of conservatism. The effectiveness of this proposal was tested both on an example from the related literature and another example of a public project portfolio with nine objective functions and large number of applicant projects.

scholarly journals Braille Block Detection via Multi-Objective Optimization from an Egocentric Viewpoint

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2775
Author(s):  
Tsubasa Takano ◽  
Takumi Nakane ◽  
Takuya Akashi ◽  
Chao Zhang
Keyword(s):  
Optimization Problem ◽  
Line Pair ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Optimization Framework ◽  
Visually Impaired People ◽  
Comprehensive Comparison ◽  
Basic Characteristics ◽  
Support Devices

In this paper, we propose a method to detect Braille blocks from an egocentric viewpoint, which is a key part of many walking support devices for visually impaired people. Our main contribution is to cast this task as a multi-objective optimization problem and exploits both the geometric and the appearance features for detection. Specifically, two objective functions were designed under an evolutionary optimization framework with a line pair modeled as an individual (i.e., solution). Both of the objectives follow the basic characteristics of the Braille blocks, which aim to clarify the boundaries and estimate the likelihood of the Braille block surface. Our proposed method was assessed by an originally collected and annotated dataset under real scenarios. Both quantitative and qualitative experimental results show that the proposed method can detect Braille blocks under various environments. We also provide a comprehensive comparison of the detection performance with respect to different multi-objective optimization algorithms.

Analyzing the Objective Functions for Multi-Objective Optimization of the Amplifier Adaptive Control of Operating Point

2021 ◽  
Author(s):  
Erick A. Barboza ◽  
Carmelo J. A. Bastos-Filho ◽  
Daniel A. R. Chaves ◽  
Joaquim F. Martins-Filho ◽  
Leonardo D. Coelho ◽  
...  
Keyword(s):  
Adaptive Control ◽  
Operating Point ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Multi Objective

scholarly journals Localized probability of improvement for kriging based multi-objective optimization

Open Physics ◽  
2017 ◽  
Vol 15 (1) ◽  
pp. 954-958
Author(s):  
Yinjiang Li ◽  
Song Xiao ◽  
Paolo Di Barba ◽  
Mihai Rotaru ◽  
Jan K. Sykulski
Keyword(s):  
Uniform Distribution ◽  
Nearest Neighbor ◽  
Higher Dimensions ◽  
Multi Objective Optimization ◽  
New Approach ◽  
Multi Objective ◽  
Local Probability ◽  
Pareto Fronts ◽  
Probability Of Improvement ◽  
Infill Sampling

AbstractThe paper introduces a new approach to kriging based multi-objective optimization by utilizing a local probability of improvement as the infill sampling criterion and the nearest neighbor check to ensure diversification and uniform distribution of Pareto fronts. The proposed method is computationally fast and linearly scalable to higher dimensions.

Kinematic Multi-Objective Optimization of Circular-Toothed Gerotor Pumps by Genetic Algorithm

2017 ◽  
Author(s):  
Andrew J. Robison ◽  
Andrea Vacca
Keyword(s):  
Genetic Algorithm ◽  
Design Method ◽  
Third Party ◽  
Low Flow ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Generation Algorithm ◽  
Multi Objective ◽  
Pareto Curve

A gerotor gear generation algorithm has been developed that evaluates key performance objective functions to be minimized or maximized, and then an optimization algorithm is applied to determine the best design. Because of their popularity, circular-toothed gerotors are the focus of this study, and future work can extend this procedure to other gear forms. Parametric equations defining the circular-toothed gear set have been derived and implemented. Two objective functions were used in this kinematic optimization: maximize the ratio of displacement to pump radius, which is a measure of compactness, and minimize the kinematic flow ripple, which can have a negative effect on system dynamics and could be a major source of noise. Designs were constrained to ensure drivability, so the need for additional synchronization gearing is eliminated. The NSGA-II genetic algorithm was then applied to the gear generation algorithm in modeFRONTIER, a commercial software that integrates multi-objective optimization with third-party engineering software. A clear Pareto front was identified, and a multi-criteria decision-making genetic algorithm was used to select three optimal designs with varying priorities of compactness vs low flow variation. In addition, three pumps used in industry were scaled and evaluated with the gear generation algorithm for comparison. The scaled industry pumps were all close to the Pareto curve, but the optimized designs offer a slight kinematic advantage, which demonstrates the usefulness of the proposed gerotor design method.

A novel heuristic, based on a new robustness concept, for multi-objective project portfolio optimization

2020 ◽  
Vol 139 ◽  
pp. 106187
Author(s):  
Amin Mohammadnejad Daryani ◽  
Mohammad Mohammadpour Omran ◽  
Ahmad Makui
Keyword(s):  
Portfolio Optimization ◽  
Project Portfolio ◽  
Multi Objective

A Method for Solving Multi-Objective Optimization Problems Containing an Infinite Number of Parameterized Objectives

2020 ◽  
Author(s):  
Eliot Rudnick-Cohen
Keyword(s):  
Decision Making ◽  
Infinite Number ◽  
Optimization Problems ◽  
Pareto Frontier ◽  
Brute Force ◽  
Multi Objective Optimization ◽  
New Approach ◽  
Multi Objective ◽  
Brute Force Approach ◽  
Better Than

Abstract Multi-objective decision making problems can sometimes involve an infinite number of objectives. In this paper, an approach is presented for solving multi-objective optimization problems containing an infinite number of parameterized objectives, termed “infinite objective optimization”. A formulation is given for infinite objective optimization problems and an approach for checking whether a Pareto frontier is a solution to this formulation is detailed. Using this approach, a new sampling based approach is developed for solving infinite objective optimization problems. The new approach is tested on several different example problems and is shown to be faster and perform better than a brute force approach.

Sign in / Sign up

Export Citation Format

Share Document