arrow
返回

Solving multi-objective robust optimization problems via Stakelberg-based game model

delete2024-12-01
delete0
PRE
AI
A
Adham Salih *
E
Erella Eisenstadt Matalon
DOI:10.1016/j.swevo.2024.101734delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Real-world multi-objective engineering problems frequently involve uncertainties stemming from environmental factors, production inaccuracies, and other sources. A critical aspect of addressing these problems, termed Multi-Objective Robust Optimization (MORO) problems, is the development of solutions that are both optimal and resilient to uncertainties. This paper proposes addressing these uncertainties through the application of Stackelberg game models, a novel approach involving the interaction of two players. The Leader searches for optimal and robust solutions and the Follower generates uncertainties based on the Leader's chosen solutions. The Follower seeks to tackle the most challenging uncertainties associated with the Leader's candidate solutions. Additionally, this paper introduces a novel metric to assess the robustness of a given set of solutions concerning specified uncertainties. Based on the proposed approach, a co-evolutionary algorithm is developed. A numerical study is then conducted to evaluate the algorithm by comparing its performance with those obtained by four benchmark algorithms on nine benchmark MORO problems. The numerical study also aims to assess its sensitivity to run parameter variations. The experimental results demonstrate the proposed approach's effectiveness in identifying a non-dominated robust set of solutions.
Keyword:
Robust multi-objective optimization
Multi-objective games
Stacklberg game model
Pareto-optimality
Evolutionary computation
Co-evolutionary algorithms
Uncertainty

期刊

Swarm and Evolutionary Computation 封面图
Swarm and Evolutionary Computation
IF:
8.5
论文数:
2.2K
被引数:
1.0W

机构

B
Braude Academic College of Engineering
学者数:
272
论文数: 294
被引数: 0
引用论文

引用论文

学者 查看更多内容