A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems

Author:

Kahagalage SanathORCID,Turan Hasan Hüseyin,Jalalvand Fatemeh,El Sawah Sondoss

Abstract

AbstractMulti-objective optimization problems and their solution algorithms are of great importance as single-objective optimization problems are not usually a true representation of many real-world problems. In general, multi-objective optimization problems result in a large set of Pareto optimal solutions. Each solution in this set is optimal with some trade-offs. Therefore, it is difficult for the decision-maker to select a solution, especially in the absence of subjective or judgmental information. Moreover, an analysis of all the solutions is computationally expensive and, hence, not practical. Thus, researchers have proposed several techniques such as clustering and ranking of Pareto optimal solutions to reduce the number of solutions. The ranking methods are often used to obtain a single solution, which is not a good representation of the entire Pareto set. This paper deviates from the common approach and proposes a novel graph-theoretical clustering method. The quality of the clustering based on the Silhouette score is used to determine the number of clusters. The connectivity in the objective space is used to find representative solutions for clusters. One step forward, we identify ‘extreme solutions’. Hence, the reduced set contains both extreme solutions and representative solutions. We demonstrate the performance of the proposed method by using different 3D and 8D benchmark Pareto fronts as well as Pareto fronts from a case study in Royal Australian Navy. Results revealed that the reduced set obtained from the proposed method outperforms that from theK-means clustering, which is the most popular traditional clustering approach in Pareto pruning.

Funder

University of New South Wales

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications,Business, Management and Accounting (miscellaneous)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3