skip to main content
10.1145/3590003.3590030acmotherconferencesArticle/Chapter ViewAbstractPublication PagescacmlConference Proceedingsconference-collections
research-article

Multi-strategy Improved Multi-objective Harris Hawk Optimization Algorithm with Elite Opposition-based Learning

Published:29 May 2023Publication History

ABSTRACT

Abstract: To make up for the deficiencies of the Harris hawk optimization algorithm (HHO) in solving multi-objective optimization problems with low algorithm accuracy, slow rate of convergence, and easily fall into the trap of local optima, a multi-strategy improved multi-objective Harris hawk optimization algorithm with elite opposition-based learning (MO-EMHHO) is proposed. First, the population is initialized by Sobol sequences to increase population diversity. Second, incorporate the elite backward learning strategy to improve population diversity and quality. Further, an external profile maintenance method based on an adaptive grid strategy is proposed to make the solution better contracted to the real Pareto frontier. Subsequently, optimize the update strategy of the original algorithm in a non-linear energy update way to improve the exploration and development of the algorithm. Finally, improving the diversity of the algorithm and the uniformity of the solution set using an adaptive variation strategy based on Gaussian random wandering. Experimental comparison of the multi-objective particle swarm algorithm (MOPSO), multi-objective gray wolf algorithm (MOGWO), and multi-objective Harris Hawk algorithm (MOHHO) on the commonly used benchmark functions shows that the MO-EMHHO outperforms the other compared algorithms in terms of optimization seeking accuracy, convergence speed and stability, and provides a new solution to the multi-objective optimization problem.

References

  1. Deb K, Agrawal S, Pratap A, A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II[J]. Lecture notes in computer science, 2000: 849-858.Google ScholarGoogle ScholarCross RefCross Ref
  2. Deb K, Jain H. An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints[J]. IEEE Transactions on Evolutionary Computation, 2014, 18(4):577-601.Google ScholarGoogle ScholarCross RefCross Ref
  3. Xue F, Sanderson A C, Graves R J. Pareto-based multi-objective differential evolution[C]//Congress on Evolutionary Computation, 2003. CEC'03. IEEE, 2003, 2: 862-869.Google ScholarGoogle Scholar
  4. Coello C, Lechuga M S. MOPSO: A proposal for multiple objective particle swarm optimization[C]// Congress on Evolutionary Computation. IEEE Service Center, 2002.Google ScholarGoogle Scholar
  5. Gong M, Jiao L, Du H, Multiobjective immune algorithm with nondominated neighbor-based selection[J]. Evolutionary computation, 2008, 16(2): 225-255.Google ScholarGoogle Scholar
  6. Chaharsooghi S K. An intelligent multi-colony multi-objective ant colony optimization for the 0-1 knapsack problem[J]. Proc. of IEEE/CEC, 2008, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  7. He X S, Li N, Yang X S, Multi-objective Cuckoo Search Algorithm[J]. Journal of System Simulation, 2015,27(04):731-737.Google ScholarGoogle Scholar
  8. Heidari A A, Mirjalili S, Faris H, Harris hawks optimization: Algorithm and applications[J]. Future generation computer systems, 2019, 97: 849-872.Google ScholarGoogle Scholar
  9. Yüzge U, Kusoglu M. Multi-objective harris hawks optimizer for multiobjective optimization problems[J]. BSEU Journal of Engineering Research and Technology, 2020, 1(1): 31-41.Google ScholarGoogle Scholar
  10. Selim A, Kamel S, Alghamdi A S, Optimal placement of DGs in distribution system using an improved harris hawks optimizer based on single-and multi-objective approaches[J]. IEEE Access, 2020, 8: 52815-52829.Google ScholarGoogle ScholarCross RefCross Ref
  11. Devarapalli R, Bhattacharyya B. Optimal parameter tuning of power oscillation damper by MHHO algorithm[C]//2019 20th International conference on intelligent system application to power systems (ISAP). IEEE, 2019: 1-7.Google ScholarGoogle Scholar
  12. Bratley P, Fox B L. Implementing sobols quasirandom sequence generator (algorithm 659)[J]. ACM Transactions on Mathematical Software, 2003, 29(1): 49-57.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Tizhoosh, H. R . Opposition-Based Learning: A New Scheme for Machine Intelligence[C]// International Conference on International Conference on Computational Intelligence for Modelling, Control & Automation. IEEE, 2005:695-701.Google ScholarGoogle Scholar
  14. Peng H, Zeng Z, Deng C, Multi-strategy serial cuckoo search algorithm for global optimization[J]. Knowledge-Based Systems, 2021, 214: 106729.Google ScholarGoogle ScholarCross RefCross Ref
  15. Zhang Q, Zhou A, Zhao S, Multiobjective optimization test instances for the CEC 2009 special session and competition[J]. University of Essex, Colchester, UK and Nanyang technological University, Singapore, special session on performance assessment of multi-objective optimization algorithms, technical report, 2008, 264: 1-30.Google ScholarGoogle Scholar
  16. Yanan Sun and Gary G. Yen and Zhang Yi 0001. IGD Indicator-Based Evolutionary Algorithm for Many-Objective Optimization Problems.[J]. IEEE Trans. Evolutionary Computation, 2019, 23(2): 173-187.Google ScholarGoogle Scholar

Index Terms

  1. Multi-strategy Improved Multi-objective Harris Hawk Optimization Algorithm with Elite Opposition-based Learning
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          CACML '23: Proceedings of the 2023 2nd Asia Conference on Algorithms, Computing and Machine Learning
          March 2023
          598 pages
          ISBN:9781450399449
          DOI:10.1145/3590003

          Copyright © 2023 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 29 May 2023

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed limited

          Acceptance Rates

          CACML '23 Paper Acceptance Rate93of241submissions,39%Overall Acceptance Rate93of241submissions,39%
        • Article Metrics

          • Downloads (Last 12 months)11
          • Downloads (Last 6 weeks)1

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format