A novel coupling algorithm based on glowworm swarm optimization and bacterial foraging algorithm for solving multi-objective optimization problems (Q2312428)

From MaRDI portal





scientific article; zbMATH DE number 7077436
Language Label Description Also known as
default for all languages
No label defined
    English
    A novel coupling algorithm based on glowworm swarm optimization and bacterial foraging algorithm for solving multi-objective optimization problems
    scientific article; zbMATH DE number 7077436

      Statements

      A novel coupling algorithm based on glowworm swarm optimization and bacterial foraging algorithm for solving multi-objective optimization problems (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      8 July 2019
      0 references
      Summary: In the real word, optimization problems in multi-objective optimization (MOP) and dynamic optimization can be seen everywhere. During the last decade, among various swarm intelligence algorithms for multi-objective optimization problems, glowworm swarm optimization (GSO) and bacterial foraging algorithm (BFO) have attracted increasing attention from scholars. Although many scholars have proposed improvement strategies for GSO and BFO to keep a good balance between convergence and diversity, there are still many problems to be solved carefully. In this paper, a new coupling algorithm based on GSO and BFO (MGSOBFO) is proposed for solving dynamic multi-objective optimization problems (dMOP). MGSOBFO is proposed to achieve a good balance between exploration and exploitation by dividing into two parts. Part I is in charge of exploitation by GSO and Part II is in charge of exploration by BFO. At the same time, the simulation binary crossover (SBX) and polynomial mutation are introduced into the MGSOBFO to enhance the convergence and diversity ability of the algorithm. In order to show the excellent performance of the algorithm, we experimentally compare MGSOBFO with three algorithms on the benchmark function. The results suggests that such a coupling algorithm has good performance and outperforms other algorithms which deal with dMOP.
      0 references
      multi-objective optimization (MOP)
      0 references
      coupling algorithm
      0 references
      glowworm swarm optimization (GSO)
      0 references
      bacterial foraging algorithm (BFO)
      0 references
      dynamic multi-objective optimization problems (dMOP)
      0 references
      the simulation binary crossover (SBX)
      0 references
      polynomial mutation
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references