Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems

@inproceedings{Vanaret2015HybridizationOI,
  title={Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems},
  author={Charlie Vanaret and Jean-Baptiste Gotteland and Nicolas Durand and Jean-Marc Alliot},
  booktitle={CP},
  year={2015}
}
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… CONTINUE READING