Results 241 to 250 of about 9,501,678 (288)

Hybridizations of evolutionary algorithms with Large Neighborhood Search

open access: yesComputer Science Review, 2022
Recent developments of evolutionary algorithms (EAs) for discrete optimization problems are often characterized by the hybridization of EAs with local search methods, in particular, with Large Neighborhood Search. In this survey, we consider some of the most promising directions of this kind of hybridization and provide examples in the context of well ...
Anton Eremeev   +2 more
exaly   +5 more sources

Very Large-Scale Neighborhood Search

open access: yes, 2021
Very Large-Scale Neighborhood Search is not an algorithm or a class of algorithms, but rather a conceptual framework which can be used for solving combinatorial optimization problems. The approach “concentrates on neighborhood search algorithms where the size of the neighborhood is ‘very large’ with respect to the size of the input data.” Typically ...
Maniezzo, Vittorio   +2 more
openaire   +3 more sources

Large Neighborhood Search with Decision Diagrams

open access: yesProceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Local search is a popular technique to solve combinatorial optimization problems efficiently. To escape local minima one generally uses metaheuristics or try to design large neighborhoods around the current best solution. A somewhat more black box approach consists in using an optimization solver to explore a large neighborhood.
Xavier Gillard, Pierre Schaus
openaire   +2 more sources

Neural large neighborhood search for routing problems

Artificial Intelligence, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
André Hottung, Kevin Tierney
openaire   +3 more sources

Principles for the Design of Large Neighborhood Search

Journal of Mathematical Modelling and Algorithms, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tom Carchrae, J. Christopher Beck
openaire   +2 more sources

Propagation Guided Large Neighborhood Search

2004
In this article, we explore how neighborhoods for the Large Neighborhood Search (LNS) framework can be automatically defined by the volume of propagation of our Constraint Programming (CP) solver. Thus we can build non trivial neighborhoods which will not be reduced to zero by propagation and whose size will be close to a parameter of the search ...
Laurent Perron   +2 more
openaire   +2 more sources

A survey of adaptive large neighborhood search algorithms and applications

Computers & Operations Research, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Setyo Tri Windras Mara   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy