Results 11 to 20 of about 10,004,845 (289)
Large Neighborhood Search [PDF]
, 2010 Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence traverse a more
David Pisinger, Stefan Ropke
core +7 more sources
Large Neighborhood Search with Decision Diagrams
Proceedings 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.
Gillard, Xavier, Schaus, Pierre
openaire +3 more sources
Very Large-Scale Neighborhood Search
, 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
Adaptive Large Neighborhood Search
, 2015 There has already been a lot of research on Local Search Heuristics in Computer Science. Local Search improves an initial solution by manipulating rather small parts of the solution.
Lutz, Roman
openaire +3 more sources
Revisiting the Self-adaptive Large Neighborhood Search
, 2018 This paper revisits the Self-Adaptive Large Neighborhood Search introduced by Laborie and Godard. We propose a variation in the weight-update mechanism especially useful when the LNS operators available in the portfolio exhibit unequal running times. We also propose some generic relaxations working for a large family of problems in a black-box fashion.
Thomas, Charles, Schaus, Pierre
openaire +2 more sources
A Multi-paradigm Tool for Large Neighborhood Search
, 2013 We present a general tool for encoding and solving optimization problems. Problems can be modeled using several paradigms and/or languages such as: Prolog, MiniZinc, and GECODE. Other paradigms can be included. Solution search is performed by a hybrid solver that exploits the potentiality of the Constraint Programming environment GECODE and of the ...
CIPRIANO, Raffaele +2 more
openaire +3 more sources
Reinforced Adaptive Large Neighborhood Search
, 2011 The Large Neighborhood Search metaheuristic for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. This Local Search heuristic has the particu- larity of using a complete search (such as Constraint Programming) to explore the large neighborhoods obtained by relaxing a fragment of the variables of the ...
Mairy, Jean-Baptiste +2 more
openaire +2 more sources
Explanation-based large neighborhood search [PDF]
Constraints, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lorca, Xavier +2 more
openaire +5 more sources
A Hybrid Large Neighborhood Search Algorithm for Solving the Multi Depot UAV Swarm Routing Problem
IEEE Access, 2021 This paper focuses on a modified Multi-Depot Unmanned Aerial Vehicle Routing Problem (MMDUAVRP). Comparing to classic multi-depot vehicle routing problem, our studied problem has no constraints to restrict the depot where the Unmanned Aerial Vehicle (UAV)
Xiaohui Li +4 more
doaj +1 more source
Aerospace, 2023 The runway system is more likely to be a bottleneck area for airport operations because it serves as a link between the air routes and airport ground traffic.
Jiaming Su +3 more
doaj +1 more source