期刊
INFORMATION SCIENCES
卷 521, 期 -, 页码 195-208出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2020.02.030
关键词
Multiple attributes decision making; Large-scale alternatives; Clustering; Hierarchical algorithm; Convex optimization
资金
- Science and Technology Foundation of Jiangxi Educational Committee [GJ J190287]
- National Natural Science Foundation of China [71671189, 71971217]
We consider a multiple attributes decision making (MADM) problem in the presence of large-scale alternatives. Considering the large number of alternatives, we first try to identify if there exist some alternative sets with dominative patterns by determining a hyper-plane. If so, the superior alternatives can be easily selected. We then exploit the divide and conquer idea and develop a hierarchical MADM algorithm, which selects locally superior alternatives iteratively until the globally best alternative is reached. Specifically, we first divide the large-scale alternatives into several clusters, and determine the attribute weights at each round. We then select the locally superior alternative in each cluster. The attribute weights are updated based on the former attributes weights after each clustering, so as to remain consistent with the attributes weights throughout the hierarchical MADM algorithm. Finally, numerical experiments are conducted to demonstrate the effectiveness of the proposed method. (C) 2020 Published by Elsevier Inc.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据