Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems

10/16/2015
by   Charlie Vanaret, et al.
0

The only rigorous approaches for achieving a numerical proof of optimality in global optimization are interval-based methods that interleave branching of the search-space and pruning of the subdomains that cannot contain an optimal solution. State-of-the-art solvers generally integrate local optimization algorithms to compute a good upper bound of the global minimum over each subspace. In this document, we propose a cooperative framework in which interval methods cooperate with evolutionary algorithms. The latter are stochastic algorithms in which a population of candidate solutions iteratively evolves in the search-space to reach satisfactory solutions. Within our cooperative solver Charibde, the evolutionary algorithm and the interval-based algorithm run in parallel and exchange bounds, solutions and search-space in an advanced manner via message passing. A comparison of Charibde with state-of-the-art interval-based solvers (GlobSol, IBBA, Ibex) and NLP solvers (Couenne, BARON) on a benchmark of difficult COCONUT problems shows that Charibde is highly competitive against non-rigorous solvers and converges faster than rigorous solvers by an order of magnitude.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/30/2020

Hybridization of interval methods and evolutionary algorithms for solving difficult optimization problems

Reliable global optimization is dedicated to finding a global minimum in...
research
03/22/2020

Certified Global Minima for a Benchmark of Difficult Optimization Problems

We provide the global optimization community with new optimality proofs ...
research
12/06/2019

The surprising little effectiveness of cooperative algorithms in parallel problem solving

Biological and cultural inspired optimization algorithms are nowadays pa...
research
03/27/2019

Tree Search vs Optimization Approaches for Map Generation

Search-based procedural content generation uses stochastic global optimi...
research
02/22/2019

Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems

We propose a simple, powerful, and flexible machine learning framework f...
research
12/09/2022

The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization

A hybrid framework combining the branch and bound method with multiobjec...
research
02/01/2019

Fast Re-Optimization via Structural Diversity

When a problem instance is perturbed by a small modification, one would ...

Please sign up or login with your details

Forgot password? Click here to reset