Multi-Objective Optimization in Asynchronous Environments: An Evolutionary Game Theory Approach

This paper presents an innovative approach to solving complex multi-objective optimization problems through an asynchronous and distributed evolutionary game theory method. The proposed algorithm, an extension of the IMGAMO algorithm, optimizes individual criteria separately at varying computational speeds, thus significantly enhancing computational efficiency and adaptability. This unique structure enables independent criterion optimization, catering to real-world applications where different objectives demand varying computational resources. The algorithm’s effectiveness is validated against traditional synchronous evolutionary multi-objective optimization algorithms, showing superior performance in handling diverse, real-world problems efficiently. The results underline the potential of the asynchronous approach in providing high-quality Pareto fronts, thus offering robust solutions for complex optimization challenges.

Authors

Institutions

Publication Details

Published
2024-10-21
DOI
https://doi.org/10.1109/mascots64422.2024.10786577
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Objective Optimization in Asynchronous Environments: An Evolutionary Game Theory Approach

Paweł Jarosz, Adam Marszałek
Scheduling and Optimization Algorithms
article

Multi-Objective Optimization in Asynchronous Environments: An Evolutionary Game Theory Approach

Paweł Jarosz, Adam Marszałek
article en

Abstract

This paper presents an innovative approach to solving complex multi-objective optimization problems through an asynchronous and distributed evolutionary game theory method. The proposed algorithm, an extension of the IMGAMO algorithm, optimizes individual criteria separately at varying computational speeds, thus significantly enhancing computational efficiency and adaptability. This unique structure enables independent criterion optimization, catering to real-world applications where different objectives demand varying computational resources. The algorithm’s effectiveness is validated against traditional synchronous evolutionary multi-objective optimization algorithms, showing superior performance in handling diverse, real-world problems efficiently. The results underline the potential of the asynchronous approach in providing high-quality Pareto fronts, thus offering robust solutions for complex optimization challenges.

Cracow University of Technology (PL)
Openalex Percentile: Top 66%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.