We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
This paper presents a new algorithm for enhancing the efficiency of simulation-based optimisation using local search and neural network metamodels. The local search strategy is ba...
This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem k...
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...