An initialization approach for metaheuristic algorithms by using Gibbs sampling

DOI10.1016/J.MATCOM.2024.05.010MaRDI QIDQ6993817zbMATH OpenFDO

Authors Erik Cuevas, Oscar Barba-Toscano, Héctor Escobar, Daniel Zaldivar, Alma Rodríguez-Vázquez

Publication date 25 April 2025

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.MATCOM.2024.05.010

zbMATH Keywords

Gibbs samplingmetaheuristic algorithmshigh-dimensional optimizationdifferential evolution and global solution search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 914714 (Why is no real title available?)
• A Comparison of Alternative Tests of Significance for the Problem of m Rankings
• A gentle introduction to optimization
• A novel population initialization method for accelerating evolutionary algorithms
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Dwarf mongoose optimization algorithm
• Evolution strategies. A comprehensive introduction
• GSA: A gravitational search algorithm
• Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
• Optimization based on performance of lungs in body: lungs performance-based optimization (LPO)
• Optimization by simulated annealing

This page was built for publication: An initialization approach for metaheuristic algorithms by using Gibbs sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993817)