IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i13p2937-d1183743.html
   My bibliography  Save this article

Surrogate-Assisted Automatic Parameter Adaptation Design for Differential Evolution

Author

Listed:
  • Vladimir Stanovov

    (Institute of Informatics and Telecommunication, Reshetnev Siberian State University of Science and Technology, 660037 Krasnoyarsk, Russia)

  • Eugene Semenkin

    (Institute of Informatics and Telecommunication, Reshetnev Siberian State University of Science and Technology, 660037 Krasnoyarsk, Russia)

Abstract

In this study, parameter adaptation methods for differential evolution are automatically designed using a surrogate approach. In particular, Taylor series are applied to model the searched dependence between the algorithm’s parameters and values, describing the current algorithm state. To find the best-performing adaptation technique, efficient global optimization, a surrogate-assisted optimization technique, is applied. Three parameters are considered: scaling factor, crossover rate and population decrease rate. The learning phase is performed on a set of benchmark problems from the CEC 2017 competition, and the resulting parameter adaptation heuristics are additionally tested on CEC 2022 and SOCO benchmark suites. The results show that the proposed approach is capable of finding efficient adaptation techniques given relatively small computational resources.

Suggested Citation

  • Vladimir Stanovov & Eugene Semenkin, 2023. "Surrogate-Assisted Automatic Parameter Adaptation Design for Differential Evolution," Mathematics, MDPI, vol. 11(13), pages 1-19, June.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:13:p:2937-:d:1183743
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/13/2937/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/13/2937/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Edmund K. Burke & Matthew R. Hyde & Graham Kendall & Gabriela Ochoa & Ender Özcan & John R. Woodward, 2019. "A Classification of Hyper-Heuristic Approaches: Revisited," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 453-477, Springer.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Goerigk, Marc & Hartisch, Michael, 2023. "A framework for inherently interpretable optimization models," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1312-1324.
    2. Pagnozzi, Federico & Stützle, Thomas, 2021. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints," Operations Research Perspectives, Elsevier, vol. 8(C).
    3. Philipp Heyken Soares & Leena Ahmed & Yong Mao & Christine L Mumford, 2021. "Public transport network optimisation in PTV Visum using selection hyper-heuristics," Public Transport, Springer, vol. 13(1), pages 163-196, March.
    4. Jorge M. Cruz-Duarte & José C. Ortiz-Bayliss & Iván Amaya & Yong Shi & Hugo Terashima-Marín & Nelishia Pillay, 2020. "Towards a Generalised Metaheuristic Model for Continuous Optimisation Problems," Mathematics, MDPI, vol. 8(11), pages 1-23, November.
    5. Karimi-Mamaghan, Maryam & Mohammadi, Mehrdad & Meyer, Patrick & Karimi-Mamaghan, Amir Mohammad & Talbi, El-Ghazali, 2022. "Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art," European Journal of Operational Research, Elsevier, vol. 296(2), pages 393-422.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:13:p:2937-:d:1183743. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.