Search results for "Optimization problem"
showing 10 items of 281 documents
Interactive Multiobjective Robust Optimization with NIMBUS
2018
In this paper, we introduce the MuRO-NIMBUS method for solving multiobjective optimization problems with uncertain parameters. The concept of set-based minmax robust Pareto optimality is utilized to tackle the uncertainty in the problems. We separate the solution process into two stages: the pre-decision making stage and the decision making stage. We consider the decision maker’s preferences in the nominal case, i.e., with the most typical or undisturbed values of the uncertain parameters. At the same time, the decision maker is informed about the objective function values in the worst case to support her/him to make an informed decision. To help the decision maker to understand the behavio…
Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem
2016
Abstract The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP -hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been recently proposed. In this paper, we propose a heuristic method – based on the Greedy Randomized Adaptive Search Procedure, GRASP, methodology – for finding approximate solutions to this optimization problem. In particular, we consider an advanced GRASP design in which a filtering mechanism avo…
Heuristics for the Bi-Objective Diversity Problem
2018
Abstract The Max-Sum diversity and the Max-Min diversity are two well-known optimization models to capture the notion of selecting a subset of diverse points from a given set. The resolution of their associated optimization problems provides solutions of different structures, in both cases with desirable characteristics. They have been extensively studied and we can find many metaheuristic methodologies, such as Greedy Randomized Adaptive Search Procedure, Tabu Search, Iterated Greedy, Variable Neighborhood Search, and Genetic algorithms applied to them to obtain high quality solutions. In this paper we solve the bi-objective problem in which both models are simultaneously optimized. No pre…
IRA-EMO : Interactive Method Using Reservation and Aspiration Levels for Evolutionary Multiobjective Optimization
2019
We propose a new interactive evolutionary multiobjective optimization method, IRA-EMO. At each iteration, the decision maker (DM) expresses her/his preferences as an interesting interval for objective function values. The DM also specifies the number of representative Pareto optimal solutions in these intervals referred to as regions of interest one wants to study. Finally, a real-life engineering three-objective optimization problem is used to demonstrate how IRA-EMO works in practice for finding the most preferred solution. peerReviewed
Evolutionary multi-objective optimization algorithms for fuzzy portfolio selection
2016
Graphical abstractDisplay Omitted HighlightsWe consider a constrained three-objective optimization portfolio selection problem.We solve the problem by means of evolutionary multi-objective optimization.New mutation, crossover and reparation operators are designed for this problem.They are tested in several algorithms for a data set from the Spanish stock market.Results for two performance metrics reveal the effectiveness of the new operators. In this paper, we consider a recently proposed model for portfolio selection, called Mean-Downside Risk-Skewness (MDRS) model. This modelling approach takes into account both the multidimensional nature of the portfolio selection problem and the requir…
Intelligent Multi-Start Methods
2018
Heuristic search procedures aimed at finding globally optimal solutions to hard combinatorial optimization problems usually require some type of diversification to overcome local optimality. One way to achieve diversification is to re-start the procedure from a new solution once a region has been explored, which constitutes a multi-start procedure. In this chapter we describe the best known multi-start methods for solving optimization problems. We also describe their connections with other metaheuristic methodologies. We propose classifying these methods in terms of their use of randomization, memory and degree of rebuild. We also present a computational comparison of these methods on solvi…
Greedy Randomized Adaptive Search Procedures
2017
In this chapter, we describe the process of designing heuristic procedures to solve combinatorial optimization problems.
Portfolio optimization using a credibility mean-absolute semi-deviation model
2015
We present a cardinality constrained credibility mean-absolute semi-deviation model.We prove relationships for possibility and credibility moments for LR-fuzzy variables.The return on a given portfolio is modeled by means of LR-type fuzzy variables.We solve the portfolio selection problem using an evolutionary procedure with a DSS.We select best portfolio from Pareto-front with a ranking strategy based on Fuzzy VaR. We introduce a cardinality constrained multi-objective optimization problem for generating efficient portfolios within a fuzzy mean-absolute deviation framework. We assume that the return on a given portfolio is modeled by means of LR-type fuzzy variables, whose credibility dist…
Quasi-nash equilibria for non-convex distributed power allocation games in cognitive radios
2013
In this paper, we consider a sensing-based spectrum sharing scenario in cognitive radio networks where the overall objective is to maximize the sum-rate of each cognitive radio user by optimizing jointly both the detection operation based on sensing and the power allocation, taking into account the influence of the sensing accuracy and the interference limitation to the primary users. The resulting optimization problem for each cognitive user is non-convex, thus leading to a non-convex game, which presents a new challenge when analyzing the equilibria of this game where each cognitive user represents a player. In order to deal with the non-convexity of the game, we use a new relaxed equilib…
Constraint handling in efficient global optimization
2017
Real-world optimization problems are often subject to several constraints which are expensive to evaluate in terms of cost or time. Although a lot of effort is devoted to make use of surrogate models for expensive optimization tasks, not many strong surrogate-assisted algorithms can address the challenging constrained problems. Efficient Global Optimization (EGO) is a Kriging-based surrogate-assisted algorithm. It was originally proposed to address unconstrained problems and later was modified to solve constrained problems. However, these type of algorithms still suffer from several issues, mainly: (1) early stagnation, (2) problems with multiple active constraints and (3) frequent crashes.…