Interactive algorithms for a broad underlying family of preference functions

Date

2018-02-16

Author

Karakaya, Gülşah
AHİPAŞAOĞLU, Selin Damla

Metadata

Show full item record

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

Item Usage Stats

204
views

0
downloads

In multi-criteria decision making approaches it is typical to consider an underlying preference function that is assumed to represent the decision maker's preferences. In this paper we introduce a broad family of preference functions that can represent a wide variety of preference structures. We develop the necessary theory and interactive algorithms for both the general family of the preference functions and for its special cases. The algorithms guarantee to find the most preferred solution (point) of the decision maker under the assumed conditions. The convergence of the algorithms are achieved by progressively reducing the solution space based on the preference information obtained from the decision maker and the properties of the assumed underlying preference functions. We first demonstrate the algorithms on a simple bi-criteria problem with a given set of available points. We also test the performances of the algorithms on three-criteria knapsack problems and show that they work well.

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, Information Systems and Management

URI

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

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

DOI

https://doi.org/10.1016/j.ejor.2017.07.028

Collections

Department of Business Administration, Article

Suggestions

OpenMETU
Core

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...
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 APPROACH FOR FINDING THE MOST PREFERRED ALTERNATIVE IN THE PRESENCE OF MULTIPLE CRITERIA Köksalan, Mustafa Murat; TANER, OV (Elsevier BV, 1992-07-10) An interactive approach for discrete multiple criteria decision making problems is developed. The approach requires the decision maker to compare pairs of presented alternatives. These alternatives may be existing alternatives or dummy alternatives created from existing alternatives. Inferior alternatives are sequentially eliminated by either using the responses of the decision maker directly or by constructing cones of inferior solutions based on these responses. The approach converges to the most preferre...
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...
Incorporating wealth information into a multiple criteria decision making model Karasakal, Esra (Elsevier BV, 2003-10-01) We describe how a multiple criteria decision making (MCDM) modelling framework can be extended to account for one of the behavioral ramifications of a decision making activity, namely, the decision maker's (I)M's) perception of his/her current wealth status, referred to as decisional wealth. Within the MCDM framework, decisional wealth reflects the relative achievements of each of the objectives in a given efficient solution. It is our argument that a DM's preferences and the importance of his/her objective...

Citation Formats

G. Karakaya and S. D. AHİPAŞAOĞLU, “Interactive algorithms for a broad underlying family of preference functions,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 248–262, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42475.