Multi-objective large neighborhood search
Abstract Large neighborhood search (LNS)[25] is a framework that combines the
expressiveness of constraint programming with the efficiency of local search to solve …
expressiveness of constraint programming with the efficiency of local search to solve …
Explanation-based large neighborhood search
One of the most well-known and widely used local search techniques for solving
optimization problems in Constraint Programming is the Large Neighborhood Search (LNS) …
optimization problems in Constraint Programming is the Large Neighborhood Search (LNS) …
Cost impact guided LNS
M Lombardi, P Schaus - Integration of AI and OR Techniques in Constraint …, 2014 - Springer
Abstract In Large Neighborhood Search (LNS)[14], a problem is solved by repeatedly
exploring (via tree search) a neighborhood of an incumbent solution. Whenever an …
exploring (via tree search) a neighborhood of an incumbent solution. Whenever an …
[PDF][PDF] Une simple heuristique pour rapprocher DFS et LNS pour les COP
J Vion, S Piechowiak - Proceedings of JFPC, 2017 - cril.univ-artois.fr
Résumé Dans cet article, nous montrons comment une combinaison de stratégies de
branchement et de redémarrages pour la recherche en profondeur d'abord (DFS) permet de …
branchement et de redémarrages pour la recherche en profondeur d'abord (DFS) permet de …
An exploration-exploitation compromise-based adaptive operator selection for local search
N Veerapen, J Maturana, F Saubion - … of the 14th annual conference on …, 2012 - dl.acm.org
This paper deals with the adaptive selection of operators in the context of local search (LS).
In evolutionary algorithms, diversity is a key concept. We consider a related idea: the …
In evolutionary algorithms, diversity is a key concept. We consider a related idea: the …
Variable objective large neighborhood search: A practical approach to solve over-constrained problems
P Schaus - 2013 IEEE 25th International Conference on Tools …, 2013 - ieeexplore.ieee.org
Everyone having used Constraint Programming (CP) to solve hard combinatorial
optimization problems with a standard exhaustive Branch & Bound Depth First Search (B&B …
optimization problems with a standard exhaustive Branch & Bound Depth First Search (B&B …
[PDF][PDF] Advanced modelling and search techniques for routing and scheduling problems.
C Thomas - 2023 - dial.uclouvain.be
This thesis presents the application of several Constraint Programming (CP) techniques to
combinatorial problems. In particular, hybrid scheduling and routing problems such as Dial …
combinatorial problems. In particular, hybrid scheduling and routing problems such as Dial …
Power-Aware Job Dispatching in High Performance Computing Systems
A Borghesi - 2017 - amsdottorato.unibo.it
This works deals with the power-aware job dispatching problem in supercomputers; broadly
speaking the dispatching consists of assigning finite capacity resources to a set of activities …
speaking the dispatching consists of assigning finite capacity resources to a set of activities …
[PDF][PDF] Self-adapting LNS minimizing expected time to improvement, applied to the vehicle routing problem
A Ancion, B Dardenne, P Schaus, Y DEVILLE… - dial.uclouvain.be
ABSTRACT Large Neighbourhood Search (LNS) has been used successfully to solve many
optimization problems. LNS proceeds by successive relaxations and reconstructions of an …
optimization problems. LNS proceeds by successive relaxations and reconstructions of an …
[PDF][PDF] Contrôle de la Propagation et de la Recherche dans un Solveur de Contraintes
MG VERFAILLIE - theses.hal.science
La modélisation de problème sous forme de problème de satisfaction de contraintes, ou
CSP (pour “Constraint Satisfaction Problem” en anglais), et leur résolution, a vu naitre au …
CSP (pour “Constraint Satisfaction Problem” en anglais), et leur résolution, a vu naitre au …