FCFan Chen

Fan Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Fan Chen has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Dual-Surrogate Competition-Assisted Evolutionary Algorithm With Triggered Constraint First Search for Expensive Constrained Optimization

    by Kunjie Yu, Yuhan Chai, Fan Chen, Ke Chen, Rui Nie

    Expensive constrained optimization problems (ECOPs), which frequently arise in real-world engineering optimization, are often limited by the number of evaluations. Using surrogate-assisted evolutionary algorithms (EAs) to reduce computational costs is a common approach. However, surrogate model errors are inevitable and often mislead the search direction of EAs. Most existing algorithms overlook the inevitability of such errors and attempt to minimize them through techniques like data selection, which might be ineffective for problems with highly complex constraint and objective functions. Therefore, we propose a dual-surrogate competition assisted EA with triggered constraint-first search (DC-TCFS) for ECOPs, aiming to reduce the misleading effects of surrogate models on the evolutionary process. In this study, two surrogate models are used to assist local searches through competition, effectively mitigating the impact of errors from a single surrogate model. A triggered constraint-first search method is proposed to quickly identify a feasible solution for problems with complex constraints. Additionally, an adaptive sampling criterion is designed to guide the algorithm toward solutions that are more beneficial to the evolutionary process. Experimental results demonstrate that the proposed algorithm outperforms state-of-the-art methods across various benchmark problems, real-world problems and a motor design optimization problem, highlighting its effectiveness in solving ECOPs.


  • Modal Detection Informed Classification Evaluation via Ensemble Networks for Expensive Constrained Multimodal Optimization

    by Kunjie Yu, Fan Chen, Mingyuan Yu, Jing Liang, Ke Chen

    The evaluation of objective and constraint involving expensive simulations or physical experiments with multiple optimal solutions is referred to as expensive constrained multimodal optimization problems (ECMMOPs). Under limited real function evaluations (FEs), it is challenging to find multiple optimal solutions accurately while satisfying constraints. To address these issues, this article studies a self-clustering particle swarm optimization algorithm with modal detection informed classification evaluation (MDICE) to solve ECMMOPs. To deal with multimodality, a surrogate-assisted self-clustering update mechanism is first designed to update individuals in each modality. Following that, a novel modal detection strategy is proposed based on the awareness of fitness landscapes to identify all potential modal seeds. For better utilization of FEs, a modality-guided classification evaluation strategy is designed to efficiently generate infilling samples for each constraint and modality. Moreover, to address the complex constraints, a surrogate-assisted feasibility search strategy is developed to quickly search for feasible solutions at a lower evaluation cost. Experimental results on 33 benchmark functions with various characteristics indicate that MDICE outperforms four state-of-the-art surrogate-assisted evolutionary algorithms.


  • Objective-Constraint Correlation-Guided Evolutionary Direction Adaptive Adjustment for Expensive Constrained Optimization

    by Kunjie Yu, Fan Chen, Jing Liang, Mingyuan Yu, Ke Chen, Caitong Yue, Ying Bi

    For expensive constrained optimization problems (ECOPs), the evaluation of the objective and constraints are both expensive. Due to the low computational cost of the surrogate model and the excellent search capabilities of evolutionary algorithms, surrogate-assisted evolutionary algorithms (SAEAs) have become a popular approach for solving ECOPs. When solving ECOPs, the errors in the objective and constraint surrogates will inevitably mislead the direction of evolution, making it difficult to find feasible solutions and avoid local optima. To defeat this issue, we propose an SAEA capable of adjusting the evolutionary direction to search in the correct direction as much as possible. Specifically, the correlation between objective and constraint is first analyzed, and then adaptive adjustments are made based on this correlation to revise the evolutionary direction throughout the three stages of the evolutionary process. For reproduction, an offspring enhanced generation strategy is proposed to generate promising and diverse offspring. For sampling, a dynamic infill sampling criterion is designed to select the most suitable solutions for expensive evaluations, thereby accelerating convergence. Finally, an adaptive environment selection strategy is designed to choose parents with more potential for improvement. The proposed method is evaluated on commonly used benchmark test functions and four engineering examples, with experimental results indicating its superior performance compared to other advanced methods.