3
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems

      1 , 1 , 2
      Complexity
      Hindawi Limited

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Constrained optimization plays an important role in many decision-making problems and various real-world applications. In the last two decades, various evolutionary algorithms (EAs) were developed and still are developing under the umbrella of evolutionary computation. In general, EAs are mainly categorized into nature-inspired and swarm-intelligence- (SI-) based paradigms. All these developed algorithms have some merits and also demerits. Particle swarm optimization (PSO), firefly algorithm, ant colony optimization (ACO), and bat algorithm (BA) have gained much popularity and they have successfully tackled various test suites of benchmark functions and real-world problems. These SI-based algorithms follow the social and interactive principles to perform their search process while approximating solution for the given problems. In this paper, a multiswarm-intelligence-based algorithm (MSIA) is developed to cope with bound constrained functions. The suggested algorithm integrates the SI-based algorithms to evolve population and handle exploration versus exploitation issues. Thirty bound constrained benchmark functions are used to evaluate the performance of the proposed algorithm. The test suite of benchmark function is recently designed for the special session of EAs competition in IEEE Congress on Evolutionary Computation (IEEE-CEC′13). The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the used bound constrained single optimization problems.

          Related collections

          Most cited references34

          • Record: found
          • Abstract: not found
          • Article: not found

          Evolutionary programming made faster

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Differential evolution — a simple and efficient heuristic for global optimization over continuous spaces

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Swarm Intelligence in Cellular Robotic Systems

                Bookmark

                Author and article information

                Contributors
                (View ORCID Profile)
                (View ORCID Profile)
                Journal
                Complexity
                Complexity
                Hindawi Limited
                1099-0526
                1076-2787
                February 27 2021
                February 27 2021
                : 2021
                : 1-18
                Affiliations
                [1 ]Institute of Numerical Sciences, Kohat University of Science & Technology (KUST) Technology, Kohat 26000, Khyber PakhtunKhwa (KPK), Pakistan
                [2 ]Division of Information and Computing Technology, College of Science and Engineering, Hamad Bin Khalifa University, Education City, Qatar Foundation, Doha, Qatar
                Article
                10.1155/2021/5521951
                2c2c8b7d-91f8-4ef4-a355-25ce55afeb0d
                © 2021

                https://creativecommons.org/licenses/by/4.0/


                Comments

                Comment on this article