Skip to content
naulon
Not checkedNot checked for notices yet.

An Inverse Modeling Multi-Objective Optimization Technique Based on Incremental Learning and Fuzzy Clustering

Gadallah Mohamed Abd Elaziz, Yasmine Abouelseoud, Sara H. Kamel

IEEE Access · 2025

doi:10.1109/access.2025.3590300 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The use of inverse modeling-based crossover operators in multi-objective evolutionary algorithms (MOEAs) has recently received much attention. Sampling in the objective space is advantageous over sampling in the decision space as it allows selecting promising areas worthy to explore. This paper aims to develop an inverse modeling MOEA based on decomposition that employs an incremental learning-based support vector regression (SVR) model, as an alternative to the Gaussian process model, in order to improve the quality of obtained solutions and speed up convergence of the algorithm. Several inverse SVR models are constructed and the samples in the objective space are partitioned among them based on fuzzy clustering instead of hard clustering to enrich the training process. Extensive simulations on various benchmark problems show that the proposed algorithm drastically reduces the number of function evaluations required to reach an optimal solution compared to existing methods. The algorithm is also tested on the pathfinding problem, the community detection problem, the sparse portfolio problem, and other real-world problems, all of which confirmed the scalability and superiority of the proposed algorithm.

Abstract licence: CC BY-NC-ND

References39

    39 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.