Compounding problem in an interactive multiple objective optimization method
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, K. Sam | - |
dc.contributor.author | Lee, Pyoungsoo | - |
dc.date.accessioned | 2021-09-04T03:16:45Z | - |
dc.date.available | 2021-09-04T03:16:45Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2016-02-01 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/89572 | - |
dc.description.abstract | This note finds and resolves a compounding problem in the interactive multi-objective optimization method developed by Park and Shin (2012). The compounding problem means that the algorithm generates a solution unexpected by the decision maker. A concrete example of the compounding problem is demonstrated and, to remove the problem, an improved algorithm is then developed. We also show that the improved algorithm converges to the known optimal solutions faster than the earlier algorithm. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Compounding problem in an interactive multiple objective optimization method | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Park, K. Sam | - |
dc.identifier.doi | 10.1016/j.ejor.2015.08.049 | - |
dc.identifier.scopusid | 2-s2.0-84945205415 | - |
dc.identifier.wosid | 000364603700035 | - |
dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.248, no.3, pp.1132 - 1135 | - |
dc.relation.isPartOf | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.title | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.volume | 248 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 1132 | - |
dc.citation.endPage | 1135 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Business & Economics | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Management | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordAuthor | Multi-objective programming | - |
dc.subject.keywordAuthor | Interactive method | - |
dc.subject.keywordAuthor | Compounding problem | - |
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.