Within the framework of Constraint Logic Programming on finite domains (CLP(FD)), we introduce a new optimization method based on a Genetic Algorithm (GA) and designed for combinatorial problems whose search spaces are too large and/or objective functions too complex for usual Constraint Satisfaction Problem (CSP) techniques and whose constraints are too complex for conventional 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 naive 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-08-11
Classification:
optimization,
genetic algorithm,
constraints,
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
@article{hal-00937706,
author = {Barnier, Nicolas},
title = {Optimization by hybridization of a genetic algorithm with CSP techniques},
journal = {HAL},
volume = {1997},
number = {0},
year = {1997},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-00937706}
}
Barnier, Nicolas. Optimization by hybridization of a genetic algorithm with CSP techniques. HAL, Tome 1997 (1997) no. 0, . http://gdmltest.u-ga.fr/item/hal-00937706/