Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/786
Full metadata record
DC FieldValueLanguage
dc.contributor.authorÖzpeynirci, Özgür-
dc.contributor.authorÖzpeynirci, Selin-
dc.contributor.authorMousseau, Vincent-
dc.date.accessioned2023-06-16T12:47:34Z-
dc.date.available2023-06-16T12:47:34Z-
dc.date.issued2021-
dc.identifier.issn1057-9214-
dc.identifier.issn1099-1360-
dc.identifier.urihttps://doi.org/10.1002/mcda.1719-
dc.identifier.urihttps://hdl.handle.net/20.500.14365/786-
dc.description.abstractMultiple criteria sorting is the problem of assigning objects that are evaluated on multiple criteria to ordered classes. In inverse multiple criteria sorting problem, the assignment of objects to classes is known. The decision maker (DM) can implement actions to improve the scores of objects on criteria, thus enabling the assignment of objects to better classes. In inverse multiple criteria sorting problems, two types of questions arise: (1) What is the set of actions that will result in the desired classification with minimum cost? and 2) What is the set of actions to obtain the best classification without exceeding a predetermined budget? There exist two versions for each question: (i) Simple version, where the parameters of the sorting method are known and (ii) Robust version, where the parameters are not fully known. In this article, we focus on the case where the DM does not provide any budget limitation or desired classifications a priori. By implementing more actions, that is, by spending more money, better classifications may be obtained. We aim to analyse the trade-off between cost and classification, and determine the set of actions that will result in the most preferred cost-classification compromise by the DM. We develop an approach that proceeds interactively with the DM, and determines such most preferred set of actions. The developed approach assumes the simple version and uses MR-Sort as sorting model. We provide a detailed illustrative example on a real life problem and present the progress of the interactive algorithm.en_US
dc.description.sponsorshipScientific and Technological Research Council of Turkey [TUBITAK-2219]en_US
dc.description.sponsorshipScientific and Technological Research Council of Turkey, Grant/Award Number: TUBITAK-2219en_US
dc.language.isoenen_US
dc.publisherWileyen_US
dc.relation.ispartofJournal of Multı-Crıterıa Decısıon Analysısen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectinteractive algorithmen_US
dc.subjectinverse multiple criteria sortingen_US
dc.subjectMR-Sorten_US
dc.subjectmultiple criteria sortingen_US
dc.subjectMcdmen_US
dc.titleAn interactive approach for inverse multiple criteria sorting problemen_US
dc.typeArticleen_US
dc.identifier.doi10.1002/mcda.1719-
dc.identifier.scopus2-s2.0-85087144832en_US
dc.departmentİzmir Ekonomi Üniversitesien_US
dc.authoridMousseau, Vincent/0000-0001-8574-3337-
dc.authoridÖzpeynirci, Özgür/0000-0002-3695-6587-
dc.authorwosidMousseau, Vincent/E-9078-2012-
dc.authorwosidÖzpeynirci, Özgür/A-2796-2009-
dc.authorscopusid16402801100-
dc.authorscopusid25228157500-
dc.authorscopusid6701756825-
dc.identifier.volume28en_US
dc.identifier.issue3.Nisen_US
dc.identifier.startpage160en_US
dc.identifier.endpage169en_US
dc.identifier.wosWOS:000543919900001en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ2-
item.grantfulltextembargo_20300101-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.cerifentitytypePublications-
crisitem.author.dept03.05. Logistics Management-
crisitem.author.dept05.09. Industrial Engineering-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File SizeFormat 
786.pdf
  Until 2030-01-01
692.53 kBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

6
checked on Nov 20, 2024

WEB OF SCIENCETM
Citations

5
checked on Nov 20, 2024

Page view(s)

138
checked on Nov 18, 2024

Download(s)

8
checked on Nov 18, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.