Evaluating the Multiple Offspring Sampling framework on complex continuous optimization functions

被引:0
|
作者
Antonio LaTorre
Santiago Muelas
José-María Peña
机构
[1] Universidad Politécnica de Madrid,Department of Computer Systems Architecture and Technology, Facultad de Informática
[2] Consejo Superior de Investigaciones Científicas (CSIC),Instituto Cajal
来源
Memetic Computing | 2013年 / 5卷
关键词
Hybridization; Multiple Offspring Sampling; Evolution Strategies; IPOP-CMA-ES; Differential Evolution; Benchmarking; Continuous optimization;
D O I
暂无
中图分类号
学科分类号
摘要
In this contribution we present a study on the combination of Differential Evolution and the IPOP-CMA-ES algorithms. The hybrid algorithm has been constructed by using the Multiple Offspring Sampling framework, which allows the seamless combination of multiple metaheuristics in a dynamic algorithm capable of adjusting the participation of each of the composing algorithms according to their current performance. In this study we analyze the existing synergies, if any, emerging from the combination of the two algorithms. For this purpose, the COCO suite used in BBOB 2009 and 2010 Workshops has been used. The experimental results on the noiseless testbed show a robust behavior of the algorithm and a good scalability as the dimensionality increases. In the noisy testbed, the algorithm shows a good performance on functions with moderate to severe noise.
引用
收藏
页码:295 / 309
页数:14
相关论文
共 50 条
  • [1] Evaluating the Multiple Offspring Sampling framework on complex continuous optimization functions
    LaTorre, Antonio
    Muelas, Santiago
    Pena, Jose-Maria
    MEMETIC COMPUTING, 2013, 5 (04) : 295 - 309
  • [2] Multiple Offspring Sampling In Large Scale Global Optimization
    LaTorre, Antonio
    Muelas, Santiago
    Pena, Jose-Maria
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [3] Wavelet importance sampling:: Efficiently evaluating products of complex functions
    Clarberg, P
    Jarosz, W
    Akenine-Möller, T
    Jensen, HW
    ACM TRANSACTIONS ON GRAPHICS, 2005, 24 (03): : 1166 - 1175
  • [4] A learning automata based algorithm for optimization of continuous complex functions
    Zeng, XY
    Liu, ZY
    INFORMATION SCIENCES, 2005, 174 (3-4) : 165 - 175
  • [5] Machine learning framework for quantum sampling of highly constrained, continuous optimization problems
    Wilson, Blake A.
    Kudyshev, Zhaxylyk A.
    Kildishev, Alexander V.
    Kais, Sabre
    Shalaev, Vladimir M.
    Boltasseva, Alexandra
    APPLIED PHYSICS REVIEWS, 2021, 8 (04)
  • [6] QRF: An Optimization-Based Framework for Evaluating Complex Stochastic Networks
    Casale, Giuliano
    Persone, Vittoria De Nitto
    Smirni, Evgenia
    ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION, 2016, 26 (03):
  • [7] Continuous Multiple Importance Sampling
    West, Rex
    Georgiev, Iliyan
    Gruson, Adrien
    Hachisuka, Toshiya
    ACM TRANSACTIONS ON GRAPHICS, 2020, 39 (04):
  • [8] SAMPLING DESIGN OPTIMIZATION FOR SPATIAL FUNCTIONS
    OLEA, RA
    JOURNAL OF THE INTERNATIONAL ASSOCIATION FOR MATHEMATICAL GEOLOGY, 1984, 16 (04): : 369 - 392
  • [9] A framework for evaluating complex networks measurements
    Comin, Cesar H.
    Silva, Filipi N.
    Costa, Luciano da F.
    EPL, 2015, 110 (06)
  • [10] A Framework for Evaluating Continuous Microservice Delivery Strategies
    Lehmann, Martin
    Sandnes, Frode Eika
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON INTERNET OF THINGS, DATA AND CLOUD COMPUTING (ICC 2017), 2017,