An interactive algorithm for multiobjective ranking for underlying linear and quasiconcave value functions

Date

2019-07-29

Author

TEZCANER ÖZTÜRK, DİCLEHAN
Köksalan, Mustafa Murat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

184
views

0
downloads

We develop interactive algorithms to find a strict total order for a set of discrete alternatives for two different value functions: linear and quasiconcave. The algorithms first construct a preference matrix and then find a strict total order. Based on the ordering, they select a meaningful pair of alternatives to present the decision maker (DM) for comparison. We employ methods to find all implied preferences of the DM, after he or she makes a preference. Considering all the preferences of the DM, the preference matrix is updated and a new strict total order is obtained until the termination conditions are met. We test the algorithms on several instances. The algorithms show fast convergence to the exact total order for both value functions, and eliciting preference information progressively proves to be efficient.

Subject Keywords

Management of Technology and Innovation, Management Science and Operations Research, Strategy and Management, Business and International Management, Computer Science Applications

URI

https://hdl.handle.net/11511/52214

Journal

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH

DOI

https://doi.org/10.1111/itor.12704

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An efficient algorithm for the capacitated single item dynamic lot size problem Kırca, Ö. (Elsevier BV, 1990-3) A dynamic programming based algorithm is developed for the single item lot size problem with concave costs and arbitrary capacities. By making use of the extreme point properties of the problem, first the set of all feasible cumulative production levels that may occur in an optimal solution is generated. In the second stage, a dynamic programming procedure is carried out over this set. The worst case computational effort is equal to that of the standard dynamic programming approach but extensive computation...
An interactive algorithm to find the most preferred solution of multi-objective integer programs LOKMAN, BANU; Köksalan, Mustafa Murat; Korhonen, Pekka J.; Wallenius, Jyrki (Springer Science and Business Media LLC, 2016-10-01) In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming problems. We assume that the DM's preferences are consistent with a quasiconcave value function unknown to us. Based on the properties of quasiconcave value functions and pairwise preference information obtained from the DM, we generate constraints to restrict the implied inferior regions. The algorithm continues iteratively and guarantees to find the mos...
A new multiobjective simulated annealing algorithm Tekinalp, Ozan (Springer Science and Business Media LLC, 2007-09-01) A new multiobjective simulated annealing algorithm for continuous optimization problems is presented. The algorithm has an adaptive cooling schedule and uses a population of fitness functions to accurately generate the Pareto front. Whenever an improvement with a fitness function is encountered, the trial point is accepted, and the temperature parameters associated with the improving fitness functions are cooled. Beside well known linear fitness functions, special elliptic and ellipsoidal fitness functions,...
A visual interactive approach for multiple criteria decision making with monotone utility functions Köksalan, Mustafa Murat; Rizi, O (Informa UK Limited, 2001-06-01) We consider the problem of choosing the best of a set of alternatives where each alternative is evaluated on multiple criteria. We develop a visual interactive approach assuming that the decision maker (DM) has a general monotone utility function. The approach partitions the criteria space into nonoverlapping cells. The DM uses various graphical aids to move between cells and to further manipulate selected cells with the goal of creating cells that have ideal points less preferred than an alternative. When ...
Interactive evolutionary approaches to multiobjective feature selection ÖZMEN, müberra; Karakaya, Gülşah; KÖKSALAN, MUSTAFA MURAT (Wiley, 2018-05-01) In feature selection problems, the aim is to select a subset of features to characterize an output of interest. In characterizing an output, we may want to consider multiple objectives such as maximizing classification performance, minimizing number of selected features or cost, etc. We develop a preference-based approach for multiobjective feature selection problems. Finding all Pareto-optimal subsets may turn out to be a computationally demanding problem and we still would need to select a solution. There...

Citation Formats

D. TEZCANER ÖZTÜRK and M. M. Köksalan, “An interactive algorithm for multiobjective ranking for underlying linear and quasiconcave value functions,” INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, pp. 0–0, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52214.