A New Interactive Algorithm for Continuous Multiple Criteria Problems: A Portfolio Optimization Example

2021-01-01
© 2021 World Scientific Publishing Company.In continuous multiple criteria problems, finding a distinct preferred solution for a decision maker (DM) is not straightforward. There are few recent studies proposed for this task, and the algorithms developed are cognitively difficult and complex for the DM in general. We propose a novel interactive algorithm to guide the DM in converging highly-preferred solutions in continuous multiple criteria problems. We test our algorithm on portfolio optimization problems formed with the stocks included in the S&P 100 index using expected return, liquidity, conditional value at risk, and mean absolute deviation as criteria. We simulate DM responses with linear and nonlinear preference functions and use various weights for the criteria. The experiments show that our algorithm is able to find highly-preferred solutions in considerably low number of iterations. We also test our algorithm against benchmark algorithms and demonstrate that our algorithm produces superior or comparable results.
International Journal of Information Technology and Decision Making

Suggestions

A parallel between regret theory and outranking methods for multicriteria decision making under imprecise information
Ozerol, Gul; Karasakal, Esra (Springer Science and Business Media LLC, 2008-08-01)
Incorporation of the behavioral issues of the decision maker (DM) is among the aspects that each Multicriteria Decision Making (MCDM) method implicitly or explicitly takes into account. As postulated by regret theory, the feelings of regret and rejoice are among the behavioral issues associated with the entire decision making process. Within the context of MCDM, the DM may feel regret, when the chosen alternative is compared with another one having at least one better criterion value. PROMETHEE II is a wide...
A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM
KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09)
In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...
An Interactive partitioning approach for multiobjective decision making under a general monotone utility function
Karasakal, Esra (2013-09-01)
We develop an interactive partitioning approach for solving the multiobjective decision making problem of a decision maker (DM) who has an implicit general monotone utility function. The approach reduces feasible solution space using the DM's preferences. Hypothetical solutions called partition ideals (PIs) that dominate portions of the efficient frontier are generated and those that are inferior to a feasible solution are used to eliminate the dominated regions. We investigate the issues in representation ...
Interactive approaches for biobjective problems with progressively changing solution sets
Karakaya, Gülşah (Wiley, 2021-01-01)
In this study, we develop interactive approaches to find a satisfactory alternative of a decision maker (DM) having a quasiconvex preference function where the alternative set changes progressively. In this environment, we keep searching the available set of alternatives and estimating the preference function of the DM. As new alternatives emerge, we make better use of the available preference information and eventually converge to a preferred alternative of the DM. We test our approaches on biobjective, mu...
An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
Phelps, S; Köksalan, Mustafa Murat (2003-12-01)
We propose an evolutionary metaheuristic for multiobjective combinatorial optimization problems that interacts with the decision maker (DM) to guide the search effort toward his or her preferred solutions. Solutions are presented to the DM, whose pairwise comparisons are then used to estimate the desirability or fitness of newly generated solutions. The evolutionary algorithm comprising the skeleton of the metaheuristic makes use of selection strategies specifically designed to address the multiobjective na...
Citation Formats
G. Karakaya, “A New Interactive Algorithm for Continuous Multiple Criteria Problems: A Portfolio Optimization Example,” International Journal of Information Technology and Decision Making, pp. 0–0, 2021, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85099641319&origin=inward.