Interactive multi-objective optimization using mobile application; application to multi-objective linear assiqnment problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Shinmyeong | - |
dc.contributor.author | Jeong, In Jae | - |
dc.date.accessioned | 2022-07-10T14:53:44Z | - |
dc.date.available | 2022-07-10T14:53:44Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2019-01 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/148476 | - |
dc.description.abstract | In the past decades, there has been a plenty of researches on multi-objective programming (MOP) problems due to the unreality of single-objective programming problems. However, multi-objective programming problems have also been discussed in terms of information security issues, the preference of people involved in decision-making and so on. A recently developed a decentralized coordination algorithm has the advantage of generating a single Pareto optimal solution under the condition that information of each agent involved in decision making is not shared. Nevertheless, this algorithm does not reflect the preference of each decision maker, and thus can generate a biased Pareto optimal solution. Therefore, in this study, we developed a mobile application that iteratively searches the Pareto optimal solution through an interactive decentralized coordination algorithm (IDCA) by interactively exchanging agent's preference information in the realm of multi-objective linear assignment problem. An empirical study was conducted to identify factors affecting to the generation of unbiased pareto solutions with 32 human decision makers. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery | - |
dc.title | Interactive multi-objective optimization using mobile application; application to multi-objective linear assiqnment problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jeong, In Jae | - |
dc.identifier.doi | 10.1145/3314527.3314538 | - |
dc.identifier.scopusid | 2-s2.0-85064903517 | - |
dc.identifier.wosid | 000473537100003 | - |
dc.identifier.bibliographicCitation | ACM International Conference Proceeding Series, pp.12 - 19 | - |
dc.relation.isPartOf | ACM International Conference Proceeding Series | - |
dc.citation.title | ACM International Conference Proceeding Series | - |
dc.citation.startPage | 12 | - |
dc.citation.endPage | 19 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | Behavioral research | - |
dc.subject.keywordPlus | Combinatorial optimization | - |
dc.subject.keywordPlus | Decision making | - |
dc.subject.keywordPlus | Iterative methods | - |
dc.subject.keywordPlus | Mobile computing | - |
dc.subject.keywordPlus | Multi agent systems | - |
dc.subject.keywordPlus | Optimal systems | - |
dc.subject.keywordPlus | Pareto principle | - |
dc.subject.keywordPlus | Security of data | - |
dc.subject.keywordPlus | Software agents | - |
dc.subject.keywordPlus | Agent&apos | - |
dc.subject.keywordPlus | s preferences | - |
dc.subject.keywordPlus | Decentralized coordination | - |
dc.subject.keywordPlus | Empirical studies | - |
dc.subject.keywordPlus | Linear assignment | - |
dc.subject.keywordPlus | Linear assignment problem | - |
dc.subject.keywordPlus | Multi-objective programming problem | - |
dc.subject.keywordPlus | Pareto optimal solutions | - |
dc.subject.keywordPlus | Single objective programming | - |
dc.subject.keywordPlus | Multiobjective optimization | - |
dc.subject.keywordAuthor | Empirical study | - |
dc.subject.keywordAuthor | Interactive decentralized coordination | - |
dc.subject.keywordAuthor | Multi-agent system | - |
dc.subject.keywordAuthor | Multi-objective linear assignment programming | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/3314527.3314538 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.