License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. A novel learning algorithm for solving global numerical optimization problems is proposed. The proposed learning algorithm is intense stochastic search method which is based on evaluation and optimization of a hypercube and is called the hypercube optimization (HO) algorithm.TheHO algorithm comprises the initialization and evaluation process, displacement-shrink process, and searching space process.The initialization and evaluation process initializes initial solution and evaluates the solutions in given hypercube. The displacement-shrink process determines displacement and evaluates objective functions using ...
Several types of line search methods are documented in the literature and are well known for unconst...
In general, the choice of the location of the evaluation points is important in the process of respo...
This version of the article has been accepted for publication, after peer review (when applicable) a...
This paper presents the Translational Propagation algorithm; a new method for obtaining optimal or n...
In this paper, a new optimization technique known as Teaching–Learning-Based Optimization (TLBO) is ...
International audienceThe goal of our research was to enhance local search heuristics used to constr...
We propose an adaptive hyperbox algorithm (AHA), which is an instance of a locally convergent, rando...
The goal of our research was to enhance local search heuristics used to construct Latin Hypercube De...
International audienceFinding maximin latin hypercube is a discrete optimization problem considered ...
In this report, a new particle swarm optimization algorithm termed as Human Cognition Inspired Parti...
Particle swarm optimizer was proposed in 1995, and since then, it has become an extremely popular sw...
This paper describes algorithms that learn to improve search performance on large-scale optimization...
Since the last three decades, numerous search strategies have been introduced within the framework o...
which permits unrestricted use, distribution, and reproduction in any medium, provided the original ...
Global optimization of high-dimensional problems in practical applications remains a major challenge...
Several types of line search methods are documented in the literature and are well known for unconst...
In general, the choice of the location of the evaluation points is important in the process of respo...
This version of the article has been accepted for publication, after peer review (when applicable) a...
This paper presents the Translational Propagation algorithm; a new method for obtaining optimal or n...
In this paper, a new optimization technique known as Teaching–Learning-Based Optimization (TLBO) is ...
International audienceThe goal of our research was to enhance local search heuristics used to constr...
We propose an adaptive hyperbox algorithm (AHA), which is an instance of a locally convergent, rando...
The goal of our research was to enhance local search heuristics used to construct Latin Hypercube De...
International audienceFinding maximin latin hypercube is a discrete optimization problem considered ...
In this report, a new particle swarm optimization algorithm termed as Human Cognition Inspired Parti...
Particle swarm optimizer was proposed in 1995, and since then, it has become an extremely popular sw...
This paper describes algorithms that learn to improve search performance on large-scale optimization...
Since the last three decades, numerous search strategies have been introduced within the framework o...
which permits unrestricted use, distribution, and reproduction in any medium, provided the original ...
Global optimization of high-dimensional problems in practical applications remains a major challenge...
Several types of line search methods are documented in the literature and are well known for unconst...
In general, the choice of the location of the evaluation points is important in the process of respo...
This version of the article has been accepted for publication, after peer review (when applicable) a...