Results 11 to 20 of about 450,572 (276)
Explanation-Based Large Neighborhood Search [PDF]
Constraints, 2014 International audienceOne of the most well-known and widely used local search techniques for solving optimization problems in Constraint Programming is the Large Neigh-borhood Search (LNS) algorithm.
Jussien, Narendra +2 more
core +7 more sources
Solving DCOPs with Distributed Large Neighborhood Search
, 2017 The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation.
Aspenberg, Per +6 more
core +3 more sources
Constraint-based Very Large-Scale Neighborhood search [PDF]
Constraints, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mouthuy, Sébastien +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
Discretization-Strategy-Based Solution for Berth Allocation and Quay Crane Assignment Problem
Journal of Marine Science and Engineering, 2022 The continuous berth allocation and quay crane assignment problem considers the size of berths and ships, the number of quay cranes, the dynamic ships and non-crossing constraints of quay cranes.
Min Tang +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
Very large‐scale neighborhood search
International Transactions in Operational Research, 2000 AbstractNeighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in many application domains including vehicle routing, telecommunications network design, parallel machine scheduling, location theory, and clustering.
R.K. Ahuja, J.B. Orlin, D. Sharma
openaire +3 more sources
Gaussian variable neighborhood search for the file transfer scheduling problem [PDF]
Yugoslav Journal of Operations Research, 2016 This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search ...
Dražić Zorica
doaj +1 more source
Neighborhood detection and rule selection from cellular automata patterns [PDF]
, 1999 Using genetic algorithms (GAs) to search for cellular automation (CA) rules from spatio-temporal patterns produced in CA evolution is usually complicated and time-consuming when both, the neighborhood structure and the local rule are searched ...
Billings, S.A., Yang, Y.X.
core +2 more sources
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
Pisinger, David, Røpke, Stefan
openaire +2 more sources