Non-Dominated Sorting Bidirectional Differential Coevolution
Cicero S. R. Mendes, Aluizio F. R. Araújo, Lucas R. C. Farias
2024-10-25Multiobjective Optimization
Abstract
Constrained multiobjective optimization problems (CMOPs) are commonly found in real-world applications. CMOP is a complex problem that needs to satisfy a set of equality or inequality constraints. This paper proposes a variant of the bidirectional coevolution algorithm (BiCo) with differential evolution (DE). The novelties in the model include the DE differential mutation and crossover operators as the main search engine and a non-dominated sorting selection scheme. Experimental results on two benchmark test suites and eight real-world CMOPs suggested that the proposed model reached better overall performance than the original model.
Related Papers
Evaluating the Efficacy of LLM-Based Reasoning for Multiobjective HPC Job Scheduling2025-05-29iDSE: Navigating Design Space Exploration in High-Level Synthesis Using LLMs2025-05-28Clustering-Based Evolutionary Federated Multiobjective Optimization and Learning2025-04-29Bridging Evolutionary Multiobjective Optimization and GPU Acceleration via Tensorization2025-03-26Runtime Analysis of Evolutionary Algorithms for Multiparty Multiobjective Optimization2025-01-09Epoch-based Application of Problem-Aware Operators in a Multiobjective Memetic Algorithm for Portfolio Optimization2024-12-05A Performance Investigation of Multimodal Multiobjective Optimization Algorithms in Solving Two Types of Real-World Problems2024-12-04Comparative Analysis of Indicators for Multiobjective Diversity Optimization2024-10-24