Results 11 to 20 of about 7,624,569 (302)
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
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
Structure of Neighborhoods in a Large Social Network [PDF]
2009 International Conference on Computational Science and Engineering, 2009 We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph that relies on enumeration of small induced subgraphs. We make a step further in this direction by identifying not only subgraphs but also the positions occupied by the different vertices
Stoica, Alina, Prieur, Christophe
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 Large-Scale Evaluation Of Shape-Aware Neighborhood Weights And Neighborhood Sizes
Computer-Aided Design, 2021 In this paper, we define and evaluate a weighting scheme for neighborhoods in point sets. Our weighting takes the shape of the geometry, i.e., the normal information, into account. This causes the obtained neighborhoods to be more reliable in the sense that connectivity also depends on the orientation of the point set.
Martin Skrodzki, Eric Zimmermann
openaire +4 more sources
A note on possible density and diameter of counterexamples to the Seymour's second neighborhood conjecture [PDF]
Opuscula Mathematica, 2021 Seymour's second neighborhood conjecture states that every simple digraph without loops or 2-cycles contains a vertex whose second neighborhood is at least as large as its first.
Oleksiy Zelenskiy +2 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
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 +2 more sources
A Single-Product Multi-Period Inventory Routing Problem under Intermittent Demand
Information, 2023 Demand fluctuations and uncertainty bring challenges to inventory management, and intermittent demand patterns increase the risk of inventory backlogs and raise inventory holding costs.
Xin Song, Daofang Chang, Tian Luo
doaj +1 more source
Multi-Objective Large Neighborhood Search [PDF]
, 2013 Large neighborhood search (LNS) [25] is a framework that combines the expressiveness of constraint programming with the efficiency of local search to solve combinatorial optimization problems. This paper introduces an extension of LNS, called multi-objective LNS (MO-LNS), to solve multi-objective combinatorial optimization problems ubiquitous in ...
Schaus, Pierre, Hartert, Renaud
openaire +2 more sources