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

An efficient multi-objective optimization algorithm based on level swarm optimizer

Author

Listed:
  • Zhang, XuWei
  • Liu, Hao
  • Tu, LiangPing
  • Zhao, Jian

Abstract

In the past few decades, evolutionary multi-objective optimization has become a research hotspot in the field of evolutionary computing, and a large number of multi-objective evolutionary algorithms (MOEAs) have been proposed. However, MOEA is still faced with the problem that the diversity and convergence of non-dominated solutions are difficult to balance. To address these problems, an efficient multi-objective optimization algorithm based on level swarm optimizer (EMOSO) is proposed in this paper. In EMOSO, a sorting method is introduced to balance the diversity and convergence of non-dominated solutions in the whole population, which is based on non-dominated relationship and density estimation. Meanwhile, a level-based learning strategy is introduced to maintain the search for non-dominated solutions. Finally, DTLZ, ZDT and WFG series problems are utilized to verify the performance of the proposed EMOSO. Experimental results and statistical analysis indicate that EMOSO has competitive performance compared with 6 popular MOEAs. The source code of EMOSO is provided at: https://github.com/xuweizhang163/EMOSO.

Suggested Citation

  • Zhang, XuWei & Liu, Hao & Tu, LiangPing & Zhao, Jian, 2020. "An efficient multi-objective optimization algorithm based on level swarm optimizer," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 177(C), pages 588-602.
    • Handle: RePEc:eee:matcom:v:177:y:2020:i:c:p:588-602
    DOI: 10.1016/j.matcom.2020.05.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475420301841
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2020.05.025?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. Jianchang Liu & Fei Li & Xiangyong Kong & Peiqiu Huang, 2019. "Handling many-objective optimisation problems with R2 indicator and decomposition-based particle swarm optimiser," International Journal of Systems Science, Taylor & Francis Journals, vol. 50(2), pages 320-336, January.
    2. Beume, Nicola & Naujoks, Boris & Emmerich, Michael, 2007. "SMS-EMOA: Multiobjective selection based on dominated hypervolume," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1653-1669, September.
    3. Lin, Qiuzhen & Li, Jianqiang & Du, Zhihua & Chen, Jianyong & Ming, Zhong, 2015. "A novel multi-objective particle swarm optimization with multiple search strategies," European Journal of Operational Research, Elsevier, vol. 247(3), pages 732-744.
    4. Cai Dai & Yuping Wang & Wei Yue, 2015. "A new orthogonal evolutionary algorithm based on decomposition for multi-objective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(10), pages 1686-1698, October.
    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. Cuevas, Erik & Becerra, Héctor & Luque, Alberto, 2021. "Anisotropic diffusion filtering through multi-objective optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 181(C), pages 410-429.

    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. Fei Han & Yu-Wen-Tian Sun & Qing-Hua Ling, 2018. "An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism," Complexity, Hindawi, vol. 2018, pages 1-22, November.
    2. Qi You & Jun Sun & Feng Pan & Vasile Palade & Bilal Ahmad, 2021. "DMO-QPSO: A Multi-Objective Quantum-Behaved Particle Swarm Optimization Algorithm Based on Decomposition with Diversity Control," Mathematics, MDPI, vol. 9(16), pages 1-20, August.
    3. Liagkouras, Konstantinos & Metaxiotis, Konstantinos, 2021. "Improving multi-objective algorithms performance by emulating behaviors from the human social analogue in candidate solutions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1019-1036.
    4. Zhang, Yue & Zhang, Qi & Farnoosh, Arash & Chen, Siyuan & Li, Yan, 2019. "GIS-Based Multi-Objective Particle Swarm Optimization of charging stations for electric vehicles," Energy, Elsevier, vol. 169(C), pages 844-853.
    5. Gong, Wenyin & Cai, Zhihua, 2009. "An improved multiobjective differential evolution based on Pareto-adaptive [epsilon]-dominance and orthogonal design," European Journal of Operational Research, Elsevier, vol. 198(2), pages 576-601, October.
    6. Alfredo Alcayde & Raul Baños & Francisco M. Arrabal-Campos & Francisco G. Montoya, 2019. "Optimization of the Contracted Electric Power by Means of Genetic Algorithms," Energies, MDPI, vol. 12(7), pages 1-13, April.
    7. Andrea Ponti & Antonio Candelieri & Ilaria Giordani & Francesco Archetti, 2023. "Intrusion Detection in Networks by Wasserstein Enabled Many-Objective Evolutionary Algorithms," Mathematics, MDPI, vol. 11(10), pages 1-14, May.
    8. David Quintana & Roman Denysiuk & Sandra García-Rodríguez & Antonio Gaspar-Cunha, 2017. "Portfolio implementation risk management using evolutionary multiobjective optimization," Post-Print hal-01881379, HAL.
    9. Yunsong Han & Hong Yu & Cheng Sun, 2017. "Simulation-Based Multiobjective Optimization of Timber-Glass Residential Buildings in Severe Cold Regions," Sustainability, MDPI, vol. 9(12), pages 1-18, December.
    10. Yeudiel Lara Moreno & Carlos Ignacio Hernández Castellanos, 2024. "A Hierarchical Approach to a Tri-Objective Portfolio Optimization Problem Considering an ESG Index," Mathematics, MDPI, vol. 12(19), pages 1-16, October.
    11. Laumanns, Marco & Zenklusen, Rico, 2011. "Stochastic convergence of random search methods to fixed size Pareto front approximations," European Journal of Operational Research, Elsevier, vol. 213(2), pages 414-421, September.
    12. Ivo Couckuyt & Dirk Deschrijver & Tom Dhaene, 2014. "Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization," Journal of Global Optimization, Springer, vol. 60(3), pages 575-594, November.
    13. Derbel, Bilel & Humeau, Jérémie & Liefooghe, Arnaud & Verel, Sébastien, 2014. "Distributed localized bi-objective search," European Journal of Operational Research, Elsevier, vol. 239(3), pages 731-743.
    14. Ying Sun & Yuelin Gao, 2019. "A Multi-Objective Particle Swarm Optimization Algorithm Based on Gaussian Mutation and an Improved Learning Strategy," Mathematics, MDPI, vol. 7(2), pages 1-16, February.
    15. Hang Xu, 2024. "A Dynamic Tasking-Based Evolutionary Algorithm for Bi-Objective Feature Selection," Mathematics, MDPI, vol. 12(10), pages 1-23, May.
    16. Sergio Cabello, 2023. "Faster distance-based representative skyline and k-center along pareto front in the plane," Journal of Global Optimization, Springer, vol. 86(2), pages 441-466, June.
    17. Liu, Ruochen & Li, Jianxia & fan, Jing & Mu, Caihong & Jiao, Licheng, 2017. "A coevolutionary technique based on multi-swarm particle swarm optimization for dynamic multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1028-1051.
    18. Sven Schulz & Udo Buscher & Liji Shen, 2020. "Multi-objective hybrid flow shop scheduling with variable discrete production speed levels and time-of-use energy prices," Journal of Business Economics, Springer, vol. 90(9), pages 1315-1343, November.
    19. Lourdes Uribe & Johan M Bogoya & Andrés Vargas & Adriana Lara & Günter Rudolph & Oliver Schütze, 2020. "A Set Based Newton Method for the Averaged Hausdorff Distance for Multi-Objective Reference Set Problems," Mathematics, MDPI, vol. 8(10), pages 1-29, October.
    20. Houssem R. E. H. Bouchekara & Yusuf A. Sha’aban & Mohammad S. Shahriar & Makbul A. M. Ramli & Abdullahi A. Mas’ud, 2023. "Wind Farm Layout Optimization/Expansion with Real Wind Turbines Using a Multi-Objective EA Based on an Enhanced Inverted Generational Distance Metric Combined with the Two-Archive Algorithm 2," Sustainability, MDPI, vol. 15(3), pages 1-32, January.

    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:177:y:2020:i:c:p:588-602. 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.