A Sequential Learnable Evolutionary Algorithm with a Novel Knowledge Base Generation Method

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10593)

Abstract

Sequential learnable evolutionary algorithm (SLEA) provides an algorithm selection framework for solving the black box continuous design optimization problems. An algorithm pool consists of set of established algorithms. A knowledge base is trained offline. SLEA uses the algorithm-problem features to select the best algorithm from the algorithm pool. Given a problem, the default algorithm is run for the initial round. After that, an algorithm-problem feature is collected and used to map to the most similar problem in the knowledge base. Then the best algorithm for solving the problem is used in the second round. This process iterates until \( n \) rounds have been made. It is revealed that the algorithm-problem feature is a good problem identifier, thus SLEA performs well on the known problems that have been encountered. However, the performance on those unknown problems is limited if the knowledge base is biased. In this paper, we propose a modified SLEA, which performs the training process using a novel method. A relatively unbiased knowledge base is formed. Experimental results show that the modified SLEA maintains the performance of SLEA on solving the CEC 2013 test suite, while it performs better than SLEA on solving a set of randomly generated max-set of Gaussian test problems.

Keywords

Evolutionary algorithm Algorithm selection Black box design optimization problem Algorithm-problem feature 

Notes

Acknowledgement

The work described in this paper was supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 125313]. Yang Lou acknowledge the Institutional Postgraduate Studentship and the Institutional Research Tuition Grant from City University of Hong Kong.

References

  1. 1.
    Roy, R., Hinduja, S., Teti, R.: Recent advances in engineering design optimisation: challenges and future trends. CIRP Ann. Technol. 57, 697–715 (2008)CrossRefGoogle Scholar
  2. 2.
    Zhang, X., Zhang, X., Yuen, S.Y., Ho, S.L., Fu, W.N.: An improved artificial bee colony algorithm for optimal design of electromagnetic devices. IEEE Trans. Magn. 49, 4811–4816 (2013)CrossRefGoogle Scholar
  3. 3.
    Zhang, X., Fong, K.F., Yuen, S.Y.: A novel artificial bee colony algorithm for HVAC optimization problems. HVAC R Res. 19, 715–731 (2013)Google Scholar
  4. 4.
    Fong, K.F., Lee, C.K., Chow, C.K., Yuen, S.Y.: Simulation-optimization of solar-thermal refrigeration systems for office use in subtropical Hong Kong. Energy 36, 6298–6307 (2011)CrossRefGoogle Scholar
  5. 5.
    Fong, K.F., Yuen, S.Y., Chow, C.K., Leung, S.W.: Energy management and design of centralized air-conditioning systems through the non-revisiting strategy for heuristic optimization methods. Appl. Energy 87, 3494–3506 (2010)CrossRefGoogle Scholar
  6. 6.
    Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing, vol. 53. Springer, Heidelberg (2003)CrossRefMATHGoogle Scholar
  7. 7.
    Yuen, S.Y., Zhang, X., Lou, Y.: Sequential learnable evolutionary algorithm: a research program. In: IEEE International Conference on Systems, Man, and Cybernetics, SMC, pp. 2841–2848 (2015)Google Scholar
  8. 8.
    Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67–82 (1997)CrossRefGoogle Scholar
  9. 9.
    Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Bessiere, C., De Raedt, L., Kotthoff, L., Nijssen, S., O’Sullivan, B., Pedreschi, D. (eds.) Data Mining and Constraint Programming. LNCS, vol. 10101, pp. 149–190. Springer, Cham (2016). doi:10.1007/978-3-319-50137-6_7 CrossRefGoogle Scholar
  10. 10.
    Muñoz, M.A., Sun, Y., Kirley, M., Halgamuge, S.K.: Algorithm selection for black-box continuous optimization problems: a survey on methods and challenges. Inf. Sci. 317, 224–245 (2015)CrossRefGoogle Scholar
  11. 11.
    Kerschke, P., Preuss, M., Wessing, S., Trautmann, H.: Low-budget exploratory landscape analysis on multiple peaks models. In: Genetic and Evolutionary Computation Conference, GECCO, pp. 229–236 (2016)Google Scholar
  12. 12.
    Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39, 459–471 (2007)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Loshchilov, I.: CMA-ES with restarts for solving CEC 2013 benchmark problems. In: IEEE Congress on Evolutionary Computation, CEC, pp. 369–376 (2013)Google Scholar
  14. 14.
    Wang, Y., Cai, Z., Zhang, Q.: Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans. Evol. Comput. 15, 55–66 (2011)CrossRefGoogle Scholar
  15. 15.
    Zambrano-Bigiarini, M., Clerc, M., Rojas, R.: Standard particle swarm optimisation 2011 at CEC-2013: a baseline for future PSO improvements. In: IEEE Congress on Evolutionary Computation, CEC, pp. 2337–2344 (2013)Google Scholar
  16. 16.
    Qin, A.K., Huang, V.L., Suganthan, P.N.: Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans. Evol. Comput. 13, 398–417 (2009)CrossRefGoogle Scholar
  17. 17.
    Liang, J.J., Qu, B.Y., Suganthan, P.N., Hernández-Díaz, A.G.: Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Technical report 201212, Zhengzhou China; Singapore; CEC 2013 (2013)Google Scholar
  18. 18.
    Muñoz, M.A., Kirley, M.: ICARUS: Identification of complementary algorithms by uncovered sets. In: IEEE Congress of Evolutionary Computation, CEC, pp. 2427–2432 (2016)Google Scholar
  19. 19.
    Gallagher, M., Yuan, B.: A general-purpose tunable landscape generator. IEEE Trans. Evol. Comput. 10, 590–603 (2006)CrossRefGoogle Scholar
  20. 20.
    Hemert, J.I.Van: Evolving combinatorial problem instances that are difficult to solve. Evol. Comput. 14, 433–462 (2006)CrossRefGoogle Scholar
  21. 21.
    Langdon, W.B., Poli, R.: Evolving problems to learn about particle swarm optimisers and other search algorithms. IEEE Trans. Evol. Comput. 11, 561–578 (2007)CrossRefGoogle Scholar
  22. 22.
    Storn, R., Price, K.: Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 341–359 (1997)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Electronic EngineeringCity University of Hong KongHong Kong SARChina

Personalised recommendations