[HTML][HTML] A new taxonomy of global optimization algorithms

J Stork, AE Eiben, T Bartz-Beielstein - Natural Computing, 2022 - Springer
Surrogate-based optimization, nature-inspired metaheuristics, and hybrid combinations
have become state of the art in algorithm design for solving real-world optimization …

Review on nature-inspired algorithms

W Korani, M Mouhoub - Operations research forum, 2021 - Springer
Optimization and its related solving methods are becoming increasingly important in most
academic and industrial fields. The goal of the optimization process is to make a system or a …

Simulated annealing: From basics to applications

D Delahaye, S Chaimatanan, M Mongeau - Handbook of metaheuristics, 2019 - Springer
Simulated Annealing (SA) is one of the simplest and best-known metaheuristic method for
addressing difficult black box global optimization problems whose objective function is not …

Ant colony optimization for continuous domains

K Socha, M Dorigo - European journal of operational research, 2008 - Elsevier
In this paper we present an extension of ant colony optimization (ACO) to continuous
domains. We show how ACO, which was initially developed to be a metaheuristic for …

[PDF][PDF] Global optimization algorithms-theory and application

T Weise - Self-Published Thomas Weise, 2009 - researchgate.net
This e-book is devoted to global optimization algorithms, which are methods to find optimal
solutions for given problems. It especially focuses on Evolutionary Computation by …

The theory and practice of simulated annealing

D Henderson, SH Jacobson, AW Johnson - Handbook of metaheuristics, 2003 - Springer
Simulated annealing is a popular local search meta-heuristic used to address discrete and,
to a lesser extent, continuous optimization problems. The key feature of simulated annealing …

An orthogonal genetic algorithm with quantization for global numerical optimization

YW Leung, Y Wang - IEEE Transactions on Evolutionary …, 2001 - ieeexplore.ieee.org
We design a genetic algorithm called the orthogonal genetic algorithm with quantization for
global numerical optimization with continuous variables. Our objective is to apply methods of …

A hybrid genetic algorithm and particle swarm optimization for multimodal functions

YT Kao, E Zahara - Applied soft computing, 2008 - Elsevier
Heuristic optimization provides a robust and efficient approach for solving complex real-
world problems. The focus of this research is on a hybrid method combining two heuristic …

Coupled simulated annealing

S Xavier-de-Souza, JAK Suykens… - … on Systems, Man …, 2009 - ieeexplore.ieee.org
We present a new class of methods for the global optimization of continuous variables
based on simulated annealing (SA). The coupled SA (CSA) class is characterized by a set of …

Three-dimensional face recognition in the presence of facial expressions: An annotated deformable model approach

IA Kakadiaris, G Passalis, G Toderici… - … on pattern analysis …, 2007 - ieeexplore.ieee.org
In this paper, we present the computational tools and a hardware prototype for 3D face
recognition. Full automation is provided through the use of advanced multistage alignment …