A Novel Genetic Algorithm for Constrained Multimodal Multi-Objective Optimization Problems

This paper proposes a multitasking-based genetic algorithm (MTGA-CMMO) to solve constrained multimodal multi-objective optimization problems (CMMOPs). In MTGA-CMMO, the main task is assisted by two auxiliary tasks to obtain all the feasible Pareto solution sets. The constraint boundaries of auxiliar...

Full description

Saved in:
Bibliographic Details
Main Authors: Da Feng, Jianchang Liu
Format: Article
Language:English
Published: MDPI AG 2025-06-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/13/11/1851
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a multitasking-based genetic algorithm (MTGA-CMMO) to solve constrained multimodal multi-objective optimization problems (CMMOPs). In MTGA-CMMO, the main task is assisted by two auxiliary tasks to obtain all the feasible Pareto solution sets. The constraint boundaries of auxiliary task 1 are dynamically adjusted, facilitating the main task’s population in crossing infeasible regions early in the evolution and providing more evolutionary direction later in the evolution. Auxiliary task 2 can contribute to the exploitation ability of the main task. Meanwhile, a probability-based leader mating selection mechanism is devised to improve the global search capability of MTGA-CMMO. Additionally, three environmental selection strategies are designed to correspond to the different tasks in MTGA-CMMO. Extensive experimental verification demonstrates that MTGA-CMMO outperforms other comparative algorithms across multiple test instances and one practical application problem.
ISSN:2227-7390