Adaptive multimodal continuous ant colony optimization

Article English OPEN
Yang, Qiang ; Chen, Wei-Neng ; Yu, Zhengtao ; Gu, Tianlong ; Li, Yun ; Zhang, Huaxiang ; Zhang, Jun (2017)

Seeking multiple optima simultaneously, which multimodal optimization aims at, has attracted increasing attention but remains challenging. Taking advantage of ant colony optimization algorithms in preserving high diversity, this paper intends to extend ant colony optimization algorithms to deal with multimodal optimization. First, combined with current niching methods, an adaptive multimodal continuous ant colony optimization algorithm is introduced. In this algorithm, an adaptive parameter adjustment is developed, which takes the difference among niches into consideration. Second, to accelerate convergence, a differential evolution mutation operator is alternatively utilized to build base vectors for ants to construct new solutions. Then, to enhance the exploitation, a local search scheme based on Gaussian distribution is self-adaptively performed around the seeds of niches. Together, the proposed algorithm affords a good balance between exploration and exploitation. Extensive experiments on 20 widely used benchmark multimodal functions are conducted to investigate the influence of each algorithmic component and results are compared with several state-of-the-art multimodal algorithms and winners of competitions on multimodal optimization. These comparisons demonstrate the competitive efficiency and effectiveness of the proposed algorithm, especially in dealing with complex problems with high numbers of local optima.
  • References (86)
    86 references, page 1 of 9

    [1] K. Deb and A. Srinivasan, “Innovization: Innovating design principles through optimization,” in Proc. Conf. Genet. Evol. Comput., Seattle, WA, USA, 2006, pp. 1629-1636.

    [2] T. Liao, D. Aydin, and T. Stützle, “Artificial bee colonies for continuous optimization: Experimental analysis and improvements,” Swarm Intell., vol. 7, no. 4, pp. 327-356, 2013.

    [3] T. Liao, D. Molina, and T. Stützle, “Performance evaluation of automatically tuned continuous optimizers on different benchmark sets,” Appl. Soft Comput., vol. 27, pp. 490-503, Feb. 2015.

    [4] N. Chen et al., “An evolutionary algorithm with double-level archives for multiobjective optimization,” IEEE Trans. Cybern., vol. 45, no. 9, pp. 1851-1863, Sep. 2015.

    [5] Y.-C. Lin, M. Clauß, and M. Middendorf, “Simple probabilistic population-based optimization,” IEEE Trans. Evol. Comput., vol. 20, no. 2, pp. 245-262, Apr. 2016.

    [6] G. Karafotias, M. Hoogendoorn, and A. E. Eiben, “Parameter control in evolutionary algorithms: Trends and challenges,” IEEE Trans. Evol. Comput., vol. 19, no. 2, pp. 167-187, Apr. 2015.

    [7] M. A. Muñoz, M. Kirley, and S. K. Halgamuge, “Exploratory landscape analysis of continuous space optimization problems using information content,” IEEE Trans. Evol. Comput., vol. 19, no. 1, pp. 74-87, Feb. 2015.

    [8] M. Campos, R. A. Krohling, and I. Enriquez, “Bare bones particle swarm optimization with scale matrix adaptation,” IEEE Trans. Cybern., vol. 44, no. 9, pp. 1567-1578, Sep. 2014.

    [9] J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proc. IEEE Int. Conf. Neural Netw., vol. 4. Perth, WA, Australia, 1995, pp. 1942-1948.

    [10] W.-N. Chen et al., “A novel set-based particle swarm optimization method for discrete optimization problems,” IEEE Trans. Evol. Comput., vol. 14, no. 2, pp. 278-300, Apr. 2010.

  • Metrics
    No metrics available
Share - Bookmark