This paper proposes a Parallel Guided Local Search (PGLS) framework for continuous optimization. In PGLS, several guided local search (GLS) procedures (agents) are run for solving the optimization problem. The agents exchange information for speeding up the search. For example, the information exchanged could be knowledge about the landscape obtained by the agents. The proposed algorithm is applied to continuous optimization problems. The preliminary experimental results show that the algorithm is very promising
Local search algorithms perform an important role when being employed with optimization algorithms t...
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving...
The genetic algorithms (GAs) can be used as a global optimization tool for continuous and discrete f...
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Searc...
Parallel continuous optimization methods are motivated here by applications in science and engineeri...
A large number of algorithms introduced in the literature to find the global minimum of a real func...
Abstract. We present a family of algorithms for local optimization that exploit the parallel archite...
We present an algorithm that is inspired by theoretical and empirical results in social learning and...
Local search metaheuristics are a recognized means of solving hard com- binatorial problems. Over th...
Abstract. Local search is a successful approach for solving combina-torial optimization and constrai...
Over the past few decades, meta-heuristic algorithms (MHs) have proven to be powerful tools for deal...
International audienceConstraint-Based Local Search (CBLS) consist in using Local Search methods [4]...
The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimizatio...
Abstract. Local search is a successful approach for solving combina-torial optimization and constrai...
This book covers local search for combinatorial optimization and its extension to mixed-variable opt...
Local search algorithms perform an important role when being employed with optimization algorithms t...
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving...
The genetic algorithms (GAs) can be used as a global optimization tool for continuous and discrete f...
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Searc...
Parallel continuous optimization methods are motivated here by applications in science and engineeri...
A large number of algorithms introduced in the literature to find the global minimum of a real func...
Abstract. We present a family of algorithms for local optimization that exploit the parallel archite...
We present an algorithm that is inspired by theoretical and empirical results in social learning and...
Local search metaheuristics are a recognized means of solving hard com- binatorial problems. Over th...
Abstract. Local search is a successful approach for solving combina-torial optimization and constrai...
Over the past few decades, meta-heuristic algorithms (MHs) have proven to be powerful tools for deal...
International audienceConstraint-Based Local Search (CBLS) consist in using Local Search methods [4]...
The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimizatio...
Abstract. Local search is a successful approach for solving combina-torial optimization and constrai...
This book covers local search for combinatorial optimization and its extension to mixed-variable opt...
Local search algorithms perform an important role when being employed with optimization algorithms t...
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving...
The genetic algorithms (GAs) can be used as a global optimization tool for continuous and discrete f...