A multi-cycled sequential memetic computing approach for constrained optimisation

Article English OPEN
Sun, Jianyong ; Garibaldi, Jonathan M. ; Zhang, Yongquan ; Al-Shawabkeh, Abdallah (2016)

In this paper, we propose a multi-cycled sequential memetic computing structure for constrained optimisation. The structure is composed of multiple evolutionary cycles. At each cycle, an evolutionary algorithm is considered as an operator, and connects with a local optimiser. This structure enables the learning of useful knowledge from previous cycles and the transfer of the knowledge to facilitate search in latter cycles. Specifically, we propose to apply an estimation of distribution algorithm (EDA) to explore the search space until convergence at each cycle. A local optimiser, called DONLP2, is then applied to improve the best solution found by the EDA. New cycle starts after the local improvement if the computation budget has not been exceeded. In the developed EDA, an adaptive fully-factorized multivariate probability model is proposed. A learning mechanism, implemented as the guided mutation operator, is adopted to learn useful knowledge from previous cycles.\ud \ud The developed algorithm was experimentally studied on the benchmark problems in the CEC 2006 and 2010 competition. Experimental studies have shown that the developed probability model exhibits excellent exploration capability and the learning mechanism can significantly improve the search efficiency under certain conditions. The comparison against some well-known algorithms showed the superiority of the developed algorithm in terms of the consumed fitness evaluations and the solution quality.
  • References (37)
    37 references, page 1 of 4

    530 [1] Aguirre, A., Rionda, S., Coello, C., and Liza´rraga, G. (2003). Use of Multiobjective Optimization Concepts to Handle Constraints in Genetic Algorithms, volume 2723 of Lecture Notes in Computer Science, pages 573-584. Springer.

    [4] Bonyadi, M., Li, X., and Michalewicz, Z. (2014). A hybrid particle swarm with a time-adaptive topology for constrained optimization. Swarm and Evolutionary Computation, 18:22-37.

    [5] Bosman, P. A. N. and Thierens, D. (2000). Expanding from discrete to continuous estimation of distribution algorithms: The IDEA. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J. J., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature - PPSN VI. Lecture Notes in Computer Science 1917, pages 767-776.

    [6] Brest, J., Zumer, V., and Mauc´ec, M. (2006). Self-adaptive differential evolution algorithm in constrained real-parameter optimization. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 215 - 222, Vancouver, BC, Canada.

    550 [7] Caraffini, F., Neri, F., and Picinali, L. (2014). An analysis on separability for memetic computing automatic design. Information Sciences, 265:1-22.

    [8] Chen, X., Ong, Y.-S., Lim, M., and Tan, K. (2011). A multi-facet survey on memetic computation. IEEE Transactions on Evolutionary Computation, 15(5):591-607.

    555 [9] Chung, C.-J. and Reynolds, R. (1996). A testbed for solving optimization problems using culture algorithms. In Evolutionary Programming V: Proceedings of the Fifth Annual Conference on Evolutionary Programming, pages 225-236, Cambridge, Massachusetts. MIT Press.

    [10] Datta, R. and Deb, K. (2015). Evolutionary Constrained Optimization. Springer.

    560 [11] Deb, K. and Datta, R. (2010). A fast and accurate solution of constrained optimization problems using a hybrid bi-objective and penalty funcation approach. In Proceedings of the 2010 IEEE Congress on Evolutionary Computation, pages 1-8, Barcelona. IEEE.

    [12] Deb, K., Sinha, A., and Aravind, S. (2006). A population-based, parent centric procedure for constrained real-parameter optimization. In Proceedings of the

  • Related Research Results (2)
  • Metrics
    No metrics available
Share - Bookmark