Decomposition based hybrid metaheuristics
GR Raidl - European journal of operational research, 2015 - Elsevier
Difficult combinatorial optimization problems coming from practice are nowadays often
approached by hybrid metaheuristics that combine principles of classical metaheuristic …
approached by hybrid metaheuristics that combine principles of classical metaheuristic …
Replicated parallel strategies for decomposition guided VNS
This paper presents two new parallel strategies for DGVNS (Decomposition Guided VNS)
which rely on master-slave architecture. The two strategies make use of slaves that perform …
which rely on master-slave architecture. The two strategies make use of slaves that perform …
Solving PCSPs using genetic algorithms guided by structural knowledge
L Sadeg, Z Habbas, W Aggoune-Mtalaa - Agents and Artificial Intelligence …, 2015 - Springer
Abstract Solving a Partial Constraint Satisfaction Problem consists in assigning values to all
the variables of the problem such that a maximal subset of the constraints is satisfied. An …
the variables of the problem such that a maximal subset of the constraints is satisfied. An …
Contributions à la résolution des WCSP et approches déclaratives pour la fouille de données
S Loudni - 2016 - hal.science
Résumé Dans ce mémoire nous détaillons nos travaux de recherche menés depuis plus de
treize ans autour de la résolution de problèmes d'optimisation sous contraintes et la …
treize ans autour de la résolution de problèmes d'optimisation sous contraintes et la …
AGAGD-An Adaptive Genetic Algorithm Guided by Decomposition for Solving PCSPs
L Sadeg-Belkacem, Z Habbas… - … Conference on Agents …, 2015 - scitepress.org
Solving a Partial Constraint Satisfaction Problem consists in assigning values to all the
variables of the problem such that a maximal subset of the constraints is satisfied. An …
variables of the problem such that a maximal subset of the constraints is satisfied. An …