IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v230y2025icp207-226.html
   My bibliography  Save this article

Competition-based two-stage evolutionary algorithm for constrained multi-objective optimization

Author

Listed:
  • Hao, Lupeng
  • Peng, Weihang
  • Liu, Junhua
  • Zhang, Wei
  • Li, Yuan
  • Qin, Kaixuan

Abstract

In recent years, the emergence of constrained multi-objective evolutionary algorithms (CMOEAs) has made it increasingly difficult to balance between the diversity and convergence of algorithms. To address this challenge, this paper proposes a competition-based two-stage evolutionary algorithm, named CP-TSEA, for constrained multi-objective problems. In the first stage, a ɛ constraint boundary relaxation learning mechanism was applied to the auxiliary population. This mechanism not only improved the diversity of the population but also enhanced the global search capability by relaxing the constraints, allowing infeasible solutions with higher fitness rankings to participate in the evolution. In the second stage, an equal-probability competitive strategy was used to select high-quality parents from the elite mating pool to ensure that the population could converge quickly to the optimal solution. The two-stage approach not only improved the exploration ability of the algorithm, but also was able to select higher quality solutions and prevent them from falling into local optima. Additionally, the solution selection in the elite environment employed a three-criteria ranking method to maintain a balance between population diversity and convergence. In terms of experiments, CP-TSEA was compared with seven advanced CMOEAs across five test suites, and the comprehensive data showed that CP-TSEA significantly outperformed its competitors. In addition, CP-TSEA also achieved the best values in six real-world problems, which further confirmed its scalability in real-world applications.

Suggested Citation

  • Hao, Lupeng & Peng, Weihang & Liu, Junhua & Zhang, Wei & Li, Yuan & Qin, Kaixuan, 2025. "Competition-based two-stage evolutionary algorithm for constrained multi-objective optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 230(C), pages 207-226.
  • Handle: RePEc:eee:matcom:v:230:y:2025:i:c:p:207-226
    DOI: 10.1016/j.matcom.2024.11.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424004506
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2024.11.009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. C. Mendolicchio & T. Pietra, 2021. "Full and constrained Pareto efficiency with incomplete financial markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(1), pages 211-234, February.
    2. Ouyang, Haibin & Chen, Jianhong & Li, Steven & Xiang, Jianhua & Zhan, Zhi-Hui, 2023. "Altruistic population algorithm: A metaheuristic search algorithm for solving multimodal multi-objective optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 210(C), pages 296-319.
    3. Ordaz-Rivas, Erick & Torres-Treviño, Luis, 2024. "Improving performance in swarm robots using multi-objective optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 223(C), pages 433-457.
    4. Yang, Yongkuan & Yan, Bing & Kong, Xiangsong & Zhao, Jing, 2024. "A double auxiliary optimization constrained multi-objective evolutionary algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 220(C), pages 567-579.
    5. Doan, Bao & Reeves, Jonathan J. & Sherris, Michael, 2024. "Portfolio management for insurers and pension funds and COVID-19: targeting volatility for equity, balanced, and target-date funds with leverage constraints," Annals of Actuarial Science, Cambridge University Press, vol. 18(1), pages 78-101, March.
    6. Lamia Zerfa & Mohamed El-Amine Chergui, 2022. "Finding non dominated points for multiobjective integer convex programs with linear constraints," Journal of Global Optimization, Springer, vol. 84(1), pages 95-117, September.
    7. Xuping Wang & Wenping Fan & Hongxin Zhan & Zilai Sun, 2022. "Variable Neighborhood Descent for Multi-Compartment and Multi-Objective Vehicle Routing Problem in Refined Product Distribution," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 39(02), pages 1-32, April.
    8. Carlos Segura & Carlos A. Coello Coello & Gara Miranda & Coromoto León, 2016. "Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization," Annals of Operations Research, Springer, vol. 240(1), pages 217-250, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kai Zhang & Siyuan Zhao & Hui Zeng & Junming Chen, 2025. "Two-Stage Archive Evolutionary Algorithm for Constrained Multi-Objective Optimization," Mathematics, MDPI, vol. 13(3), pages 1-25, January.
    2. Junming Chen & Yanxiu Wang & Zichun Shao & Hui Zeng & Siyuan Zhao, 2025. "Dual-Population Cooperative Correlation Evolutionary Algorithm for Constrained Multi-Objective Optimization," Mathematics, MDPI, vol. 13(9), pages 1-22, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gloria Milena Vargas Gil & Lucas Lima Rodrigues & Roberto S. Inomoto & Alfeu J. Sguarezi & Renato Machado Monaro, 2019. "Weighted-PSO Applied to Tune Sliding Mode Plus PI Controller Applied to a Boost Converter in a PV System," Energies, MDPI, vol. 12(5), pages 1-18, March.
    2. Gabriele Eichfelder & Kathrin Klamroth & Julia Niebling, 2021. "Nonconvex constrained optimization by a filtering branch and bound," Journal of Global Optimization, Springer, vol. 80(1), pages 31-61, May.
    3. Ji, Bin & Zhang, Binqiao & Yu, Samson S. & Zhang, Dezhi & Yuan, Xiaohui, 2021. "An enhanced Borg algorithmic framework for solving the hydro-thermal-wind Co-scheduling problem," Energy, Elsevier, vol. 218(C).
    4. Ahmed, Marzia & Sulaiman, Mohd Herwan & Mohamad, Ahmad Johari & Rahman, Mostafijur, 2024. "Gooseneck barnacle optimization algorithm: A novel nature inspired optimization theory and application," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 218(C), pages 248-265.
    5. Fernanda Nakano Kazama & Aluizio Fausto Ribeiro Araujo & Paulo Barros Correia & Elaine Guerrero-Peña, 2021. "Constraint-guided evolutionary algorithm for solving the winner determination problem," Journal of Heuristics, Springer, vol. 27(6), pages 1111-1150, December.
    6. Han, Xiaojuan & Liu, Dahe & Liu, Jian & Kong, Lingda, 2017. "Sensitivity analysis of acquisition granularity of photovoltaic output power to capacity configuration of energy storage systems," Applied Energy, Elsevier, vol. 203(C), pages 794-807.
    7. Mohammed Mahrach & Gara Miranda & Coromoto León & Eduardo Segredo, 2020. "Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem," Mathematics, MDPI, vol. 8(11), pages 1-23, November.
    8. Yuling Lai & Junming Chen & Yile Chen & Hui Zeng & Jialin Cai, 2025. "Feedback Tracking Constraint Relaxation Algorithm for Constrained Multi-Objective Optimization," Mathematics, MDPI, vol. 13(4), pages 1-22, February.
    9. Adeel, Muhammad & Hassan, Ahmad Kamal & Sher, Hadeed Ahmed & Murtaza, Ali Faisal, 2021. "A grade point average assessment of analytical and numerical methods for parameter extraction of a practical PV device," Renewable and Sustainable Energy Reviews, Elsevier, vol. 142(C).
    10. Sukhpal & Kaushal Kumar, 2024. "Multi-trip multi-compartment vehicle routing problem with backhauls," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(5), pages 1717-1734, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:230:y:2025:i:c:p:207-226. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.