Within the framework of Constraint Logic Programming on finite domains CLP(FD), we introduce a new optimization method based on a Genetic Algorithm. The main idea is the handling of sub-domains of the CSP variables by the genetic algorithm. The population of the genetic algorithm is made up of strings of sub-domains whose fitness are computed through the resolution of the corresponding sub-CSPs which are somehow much easier than the original problem. We provide basic and dedicated recombination and mutation operators with various degrees of robustness. The first set of experimentations adresses a naïve formulation of the Vehicle Routing Problem (VRP) and the Radio Link Frequency Assignement Problem (RLFAP). The results are quite encouraging as we outperform CLP(FD) techniques and genetic algorithm alone.
Publié le : 1997-05-26
Classification:
optimisation,
genetic algorithm,
constraint programming,
CPS,
algorithme génétique,
méthode mixte,
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
@article{hal-00937703,
author = {Barnier, Nicolas and Brisset, Pascal},
title = {Optimisation par hybridation d'un CSP avec un algorithme g\'en\'etique},
journal = {HAL},
volume = {1997},
number = {0},
year = {1997},
language = {fr},
url = {http://dml.mathdoc.fr/item/hal-00937703}
}
Barnier, Nicolas; Brisset, Pascal. Optimisation par hybridation d'un CSP avec un algorithme génétique. HAL, Tome 1997 (1997) no. 0, . http://gdmltest.u-ga.fr/item/hal-00937703/