A Chaotic Decomposition-Based Approach for Enhanced Multi-Objective Optimization

Multi-objective optimization problems often face challenges in balancing solution accuracy, computational efficiency, and convergence speed. Many existing methods struggle with achieving an optimal trade-off between exploration and exploitation, leading to premature convergence or excessive computat...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics (Basel) Jg. 13; H. 5; S. 817
Hauptverfasser: Alikhani Koupaei, Javad, Ebadi, Mohammad Javad
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Basel MDPI AG 01.03.2025
Schlagworte:
Accuracy
Algorithms
Analysis
Chaos theory
chaotic maps
chaotic optimization
Computational efficiency
Computing costs
Convergence
Decomposition
decomposition-based evolutionary algorithm
Efficiency
Exploitation
Genetic algorithms
Methods
multi-objective optimization
Multiple objective analysis
Optimization algorithms
Optimization techniques
Pareto optimization
Pareto optimum
Signal processing
Tradeoffs
United States
ISSN:2227-7390, 2227-7390
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Multi-objective optimization problems often face challenges in balancing solution accuracy, computational efficiency, and convergence speed. Many existing methods struggle with achieving an optimal trade-off between exploration and exploitation, leading to premature convergence or excessive computational costs. To address these issues, this paper proposes a chaotic decomposition-based approach that leverages the ergodic properties of chaotic maps to enhance optimization performance. The proposed method consists of three key stages: (1) chaotic sequence initialization, which generates a diverse population to enhance the global search while reducing computational costs; (2) chaos-based correction, which integrates a three-point operator (TPO) and a local improvement operator (LIO) to refine the Pareto front and balance the exploration–exploitation trade-offs; and (3) Tchebycheff decomposition-based updating, ensuring efficient convergence toward optimal solutions. To validate the effectiveness of the proposed method, we conducted extensive experiments on a suite of benchmark problems and compared its performance with several state-of-the-art methods. The evaluation metrics, including inverted generational distance (IGD), generational distance (GD), and spacing (SP), demonstrated that the proposed method achieves competitive optimization accuracy and efficiency. While maintaining computational feasibility, our approach provides a well-balanced trade-off between exploration and exploitation, leading to improved solution diversity and convergence stability. The results establish the proposed algorithm as a promising alternative for solving multi-objective optimization problems.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math13050817