A CHIM-based interactive Tchebycheff procedure for multiple objective decision making
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, J | - |
dc.contributor.author | Kim, SK | - |
dc.date.accessioned | 2021-09-09T06:32:50Z | - |
dc.date.available | 2021-09-09T06:32:50Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2006-06 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/123134 | - |
dc.description.abstract | This study presents a new solution procedure for multiple objective programming (MOP). It applies the concept of the normal boundary intersection (NBI) within the framework of the interactive weighted Tchebycheff procedure (IWTP). The proposed procedure is a collaborative approach to overcome the weak points inherent in both the NBI method and IWTP. In order to control the solution procedure of pinpointing a final solution properly, we parameterized the Pareto-frontier via a set of reference point vectors based on the convex hull of individual maxima (CHIM) instead of using the varying weights of each objective. Using well-distributed reference point vectors, we could identify well-distributed Pareto-optimal solutions, thereby eliminating the IWTP filtering, stages and reducing the chance of missing the best compromise solution from the decision maker (DM)'s utility point of view. Moreover, by working with a sequence of progressively smaller subsets of reference point vectors, the DM can identify a final solution at earlier stages than with the IWTP. (c) 2004 Elsevier Ltd. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | MULTICRITERIA OPTIMIZATION PROBLEMS | - |
dc.title | A CHIM-based interactive Tchebycheff procedure for multiple objective decision making | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, SK | - |
dc.identifier.doi | 10.1016/j.cor.2004.11.007 | - |
dc.identifier.scopusid | 2-s2.0-27344447763 | - |
dc.identifier.wosid | 000234338400004 | - |
dc.identifier.bibliographicCitation | COMPUTERS & OPERATIONS RESEARCH, v.33, no.6, pp.1557 - 1574 | - |
dc.relation.isPartOf | COMPUTERS & OPERATIONS RESEARCH | - |
dc.citation.title | COMPUTERS & OPERATIONS RESEARCH | - |
dc.citation.volume | 33 | - |
dc.citation.number | 6 | - |
dc.citation.startPage | 1557 | - |
dc.citation.endPage | 1574 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | MULTICRITERIA OPTIMIZATION PROBLEMS | - |
dc.subject.keywordAuthor | multiple criteria decision making | - |
dc.subject.keywordAuthor | Tchebycheff approach | - |
dc.subject.keywordAuthor | reference points | - |
dc.subject.keywordAuthor | convex hull of individual maxima | - |
dc.subject.keywordAuthor | well-distributed Pareto-optimal solutions | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.