Differences

This shows you the differences between two versions of the page.

users:francoislucas [2011/05/31 13:32]
Francois Lucas
users:francoislucas [2011/05/31 13:32] (current)
Francois Lucas
Line 12: Line 12:
===== Work ===== ===== Work =====
-We are working on efficient search strategies for a class of CSOPs (Constraint Satisfaction and Optimization Problems). The main idea that we follow is to study the hybridization of fast (potentially) sub-optimal stochastic optimization methods, namely metaheuristics, with complete deterministic solvers from the Constraint Programming (CP) domain. Our work is applied to constrained vehicle path planning problems, taken from the military world in which computation times are critical. For those problems, we use an Ant Colony Optimization (ACO) algorithm to solve a relaxed version of the problem. The partial solution is then used to guide a Prolog CP solver, not directly but using an original method herited from the Probe Backtrack Search of the literature.+We are working on efficient search strategies for a class of CSOPs (Constraint Satisfaction and Optimization Problems). The main idea that we follow is to study the hybridization of fast (potentially) sub-optimal stochastic optimization methods, namely metaheuristics, with complete deterministic solvers from the Constraint Programming (CP) domain. Our work is applied to constrained vehicle path planning problems, taken from the military world in which computation times are critical. For those problems, we use an Ant Colony Optimization (ACO) algorithm to solve a relaxed version of the problem. The partial solution is then used to guide a Prolog CP solver, not directly but using an original method derived from the Probe Backtrack Search of the literature.
===== Publications ===== ===== Publications =====
 
users/francoislucas.txt · Last modified: 2011/05/31 13:32 by Francois Lucas
Recent changes · Show pagesource · Login