A carregar...
Publicação
Constraint reasoning with local search for continuous optimization
Autores
Orientador(es)
Resumo(s)
Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are many global and local search techniques. Global search techniques try to get the global optima of the optimization problem. However, local search techniques are used more since they try to find a local minimal solution within an area of the search space.
In Continuous Constraint Satisfaction Problems (CCSP)s, constraints are viewed as
relations between variables, and the computations are supported by interval analysis.
The continuous constraint programming framework provides branch-and-prune algorithms for covering sets of solutions for the constraints with sets of interval boxes which are the Cartesian product of intervals. These algorithms begin with an initial crude cover of the feasible space (the Cartesian product of the initial variable domains) which is recursively
refined by interleaving pruning and branching steps until a stopping criterion
is satisfied.
In this work, we try to find a convenient way to use the advantages in CCSP branchand-
prune with local search of global optimization applied locally over each pruned
branch of the CCSP. We apply local search techniques of continuous optimization over
the pruned boxes outputted by the CCSP techniques.
We mainly use steepest descent technique with different characteristics such as penalty calculation and step length. We implement two main different local search algorithms.
We use “Procure”, which is a constraint reasoning and global optimization framework,
to implement our techniques, then we produce and introduce our results over a set of
benchmarks.
Descrição
Palavras-chave
Optimization Constraint satisfaction Local search