IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v347y2019icp865-881.html
   My bibliography  Save this article

Novelty search for global optimization

Author

Listed:
  • Fister, Iztok
  • Iglesias, Andres
  • Galvez, Akemi
  • Del Ser, Javier
  • Osaba, Eneko
  • Fister, Iztok
  • Perc, Matjaž
  • Slavinec, Mitja

Abstract

Novelty search is a tool in evolutionary and swarm robotics for maintaining the diversity of population needed for continuous robotic operation. It enables nature-inspired algorithms to evaluate solutions on the basis of the distance to their k-nearest neighbors in the search space. Besides this, the fitness function represents an additional measure for evaluating the solution, with the purpose of preserving the so-named novelty solutions into the next generation. In this study, a differential evolution was hybridized with novelty search. The differential evolution is a well-known algorithm for global optimization, which is applied to improve the results obtained by the other solvers on the CEC-14 benchmark function suite. Furthermore, functions of different dimensions were taken into consideration, and the influence of the various novelty search parameters was analyzed. The results of experiments show a great potential for using novelty search in global optimization.

Suggested Citation

  • Fister, Iztok & Iglesias, Andres & Galvez, Akemi & Del Ser, Javier & Osaba, Eneko & Fister, Iztok & Perc, Matjaž & Slavinec, Mitja, 2019. "Novelty search for global optimization," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 865-881.
    • Handle: RePEc:eee:apmaco:v:347:y:2019:i:c:p:865-881
    DOI: 10.1016/j.amc.2018.11.052
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318310269
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.11.052?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Iztok Fister & Marjan Mernik & Bogdan Filipič, 2013. "Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm," Computational Optimization and Applications, Springer, vol. 54(3), pages 741-770, April.
    2. Agoston E. Eiben & Jim Smith, 2015. "From evolutionary computation to the evolution of things," Nature, Nature, vol. 521(7553), pages 476-482, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yu, Caiyang & Cai, Zhennao & Ye, Xiaojia & Wang, Mingjing & Zhao, Xuehua & Liang, Guoxi & Chen, Huiling & Li, Chengye, 2020. "Quantum-like mutation-induced dragonfly-inspired optimization approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 178(C), pages 259-289.
    2. Mehmood, Ammara & Raja, Muhammad Asif Zahoor & Ninness, Brett, 2024. "Design of fractional-order hammerstein control auto-regressive model for heat exchanger system identification: Treatise on fuzzy-evolutionary computing," Chaos, Solitons & Fractals, Elsevier, vol. 181(C).
    3. Kutlu Onay, Funda & Aydemı̇r, Salih Berkan, 2022. "Chaotic hunger games search optimization algorithm for global optimization and engineering problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 192(C), pages 514-536.
    4. Yan, Zheping & Zhang, Jinzhong & Zeng, Jia & Tang, Jialing, 2021. "Nature-inspired approach: An enhanced whale optimization algorithm for global optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 185(C), pages 17-46.
    5. Yan, Zheping & Yan, Jinyu & Wu, Yifan & Cai, Sijia & Wang, Hongxing, 2023. "A novel reinforcement learning based tuna swarm optimization algorithm for autonomous underwater vehicle path planning," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 209(C), pages 55-86.

    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. Manuel Chica & Joaquín Bautista & Jesica de Armas, 2019. "Benefits of robust multiobjective optimization for flexible automotive assembly line balancing," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 75-103, March.
    2. Luciano Ferreira Cruz & Flavia Bernardo Pinto & Lucas Camilotti & Angelo Marcio Oliveira Santanna & Roberto Zanetti Freire & Leandro Santos Coelho, 2022. "Improved multiobjective differential evolution with spherical pruning algorithm for optimizing 3D printing technology parametrization process," Annals of Operations Research, Springer, vol. 319(2), pages 1565-1587, December.
    3. Salcedo-Sanz, S. & Cuadra, L., 2019. "Quasi scale-free geographically embedded networks over DLA-generated aggregates," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1286-1305.
    4. Gobeyn, Sacha & Mouton, Ans M. & Cord, Anna F. & Kaim, Andrea & Volk, Martin & Goethals, Peter L.M., 2019. "Evolutionary algorithms for species distribution modelling: A review in the context of machine learning," Ecological Modelling, Elsevier, vol. 392(C), pages 179-195.
    5. Lucas Cuadra & Miguel Del Pino & José Carlos Nieto-Borge & Sancho Salcedo-Sanz, 2017. "Optimizing the Structure of Distribution Smart Grids with Renewable Generation against Abnormal Conditions: A Complex Networks Approach with Evolutionary Algorithms," Energies, MDPI, vol. 10(8), pages 1-31, July.
    6. Jan Zrimec & Xiaozhi Fu & Azam Sheikh Muhammad & Christos Skrekas & Vykintas Jauniskis & Nora K. Speicher & Christoph S. Börlin & Vilhelm Verendel & Morteza Haghir Chehreghani & Devdatt Dubhashi & Ver, 2022. "Controlling gene expression with deep generative design of regulatory DNA," Nature Communications, Nature, vol. 13(1), pages 1-17, December.
    7. Liu, Weilong & Zhang, Yong & Liu, Kailong & Quinn, Barry & Yang, Xingyu & Peng, Qiao, 2023. "Evolutionary multi-objective optimisation for large-scale portfolio selection with both random and uncertain returns," QBS Working Paper Series 2023/02, Queen's University Belfast, Queen's Business School.
    8. Qian Zhu & Yongqing Li & Zhen Zhang, 2023. "Swarm Robots Search for Multiple Targets Based on Historical Optimal Weighting Grey Wolf Optimization," Mathematics, MDPI, vol. 11(12), pages 1-19, June.
    9. Dong Liu & Zhihuai Xiao & Hongtao Li & Dong Liu & Xiao Hu & O.P. Malik, 2019. "Accurate Parameter Estimation of a Hydro-Turbine Regulation System Using Adaptive Fuzzy Particle Swarm Optimization," Energies, MDPI, vol. 12(20), pages 1-21, October.
    10. Luo, Kaiping & Shen, Guangya & Li, Liheng & Sun, Jianfei, 2023. "0-1 mathematical programming models for flexible process planning," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1160-1175.
    11. Behnam Kia & Allen Mendes & Akshay Parnami & Robin George & Kenneth Mobley & William L Ditto, 2020. "Nonlinear dynamics based machine learning: Utilizing dynamics-based flexibility of nonlinear circuits to implement different functions," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-17, March.
    12. Hao Li & Jianjun Zhan & Zipeng Zhao & Haosen Wang, 2024. "An Improved Particle Swarm Optimization Algorithm Based on Variable Neighborhood Search," Mathematics, MDPI, vol. 12(17), pages 1-24, August.
    13. Peng, Qiao & Liu, Weilong & Shi, Yufeng & Dai, Yuanyuan & Yu, Kunjie & Graham, Byron, 2024. "Multi-objective electricity generation expansion planning towards renewable energy policy objectives under uncertainties," Renewable and Sustainable Energy Reviews, Elsevier, vol. 197(C).

    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:eee:apmaco:v:347:y:2019:i:c:p:865-881. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.