Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Issues in selecting a representative set for multi-objective integer programs
Download
index.pdf
Date
2017
Author
Özarık, Sami Serkan
Metadata
Show full item record
Item Usage Stats
252
views
115
downloads
Cite This
Multi-objective Integer Programs (MOIPs) have many areas of application in real life since it allows the decision makers to consider conflicting objectives simultaneously. However, the optimal solution is not unique for MOIPs and the number of nondominated points of multi-objective integer programs increases exponentially with the problem size. Therefore, finding all nondominated points is computationally hard and not practical for the decision maker. Instead of generating all nondominated points, it is reasonable to generate a set of points that represents the nondominated set with a desired quality level. In this thesis, we develop algorithms to generate representative sets for different MOIPs using a new quality measure that considers the distribution of points over the nondominated set. We first introduce a density measure and analyze typical distributions of nondominated points for different MOIPs. We then develop an approach that approximates the nondominated set, categorizes the approximate nondominated set into regions based on their estimated densities and generate distribution-based representative sets.
Subject Keywords
Multiple criteria decision making.
,
Decision making
,
Decision making
URI
http://etd.lib.metu.edu.tr/upload/12621520/index.pdf
https://hdl.handle.net/11511/26824
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A Probabilistic and interactive approach to multiple criteria sorting
Mutlu, Sinem; Köksalan, Murat; Serin, Yaşar Yasemin; Department of Industrial Engineering (2015)
In this thesis, we develop a method in order to assign alternatives that are evaluated by multiple criteria into preference ordered classes probabilistically. Our motivation is that; when there are large sets of alternatives, placement could be realized in a fast and effective way based on a reasonable misclassification ratio. We assume that the underlying utility function of Decision Maker (DM) is additive. We first ask DM to place reference alternatives into the classes. We develop an interactive probabil...
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 ...
An interactive ranking-based multi-criteria choice algorithm with filtering: Applications to university selection
Karakaya, Gülşah (Orta Doğu Teknik Üniversitesi (Ankara, Turkey), 2019-6)
In this study, we develop an interactive algorithm to converge to the most preferred alternative of a decision maker (DM) among a set of discrete alternatives. The algorithm presents a limited number of alternatives to the DM and collects preference ranking of them iteratively. The preferences are modeled by a flexible and realistic preference function. To improve the performance, the alternatives presented are determined by a filtering method. We compare our algorithm with benchmark algorithms on nume...
An interactive approach for biobjective integer programs under quasiconvex preference functions
Ozturk, Diclehan Tezcaner; Köksalan, Mustafa Murat (2016-09-01)
We develop an interactive algorithm for biobjective integer programs that finds the most preferred solution of a decision maker whose preferences are consistent with a quasiconvex preference function to be minimized. During the algorithm, preference information is elicited from the decision maker. Based on this preference information and the properties of the underlying quasiconvex preference function, the algorithm reduces the search region and converges to the most preferred solution progressively. Findin...
Utilisation of Decision Support Systems in Construction Management: A Literature Survey
Günay, Göksu ; Pekeriçli, Mehmet Koray (2020-11-12)
Today, computers are widely used in all industries for data collection and analysis, interpretation of data and decision making processes. Especially Decision Support Systems, which are computer-based Information Systems providing tools for assisting managers in making semi-structured decisions, have gained stronger ground parallel to the latest developments in information technologies including artificial intelligence applications like fuzzy logic, machine learning, natural langu...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. S. Özarık, “Issues in selecting a representative set for multi-objective integer programs,” M.S. - Master of Science, Middle East Technical University, 2017.