Results 251 to 260 of about 9,501,678 (288)
Some of the next articles are maybe not open access.
Large neighborhood search for LNG inventory routing
Journal of Heuristics, 2012Liquefied Natural Gas (LNG) is steadily becoming a common mode for commercializing natural gas. Due to the capital intensive nature of LNG projects, the optimal design of LNG supply chains is extremely important from a profitability perspective. Motivated by the need for a model that can assist in the design analysis of LNG supply chains, we address an
Vikas Goel +3 more
openaire +2 more sources
A Multi-paradigm Tool for Large Neighborhood Search
2013We 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 +2 more sources
Large Neighborhood Search for Dial-a-Ride Problems
2011Dial-a-Ride problems (DARPs) arise in many urban transportation applications. The core of a DARP is a pick and delivery routing with multiple vehicles in which customers have ride-time constraints and routes have a maximum duration. This paper considers DARPs for which the objective is to minimize the routing cost, a complex optimization problem which ...
Siddhartha Jain 0001 +1 more
openaire +2 more sources
Revisiting the Self-adaptive Large Neighborhood Search
2018This 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.
Charles Thomas 0005, Pierre Schaus
openaire +1 more source
A Large Neighborhood Search Heuristic for Graph Coloring
2007We propose a new local search heuristic for graph coloring that searches very large neighborhoods. The heuristic is based on solving a MAX-CUT problem at each step. While the MAX-CUT problem is formally hard, fast heuristics that give "good" cuts are available to solve this. We provide computational results on benchmark instances. The proposed approach
Michael A. Trick, Hakan Yildiz
openaire +1 more source
Adaptive large neighborhood search for scheduling of mobile robots
Proceedings of the Genetic and Evolutionary Computation Conference, 2019Our work addresses the scheduling of mobile robots for transportation and processing of operations on machines in a flexible manufacturing system. Both mobile robots and automated guided vehicles (AGVs) can transport components among machines in the working space.
Quang-Vinh Dang 0002 +2 more
openaire +1 more source
Very Large-Scale Neighborhood Search
2013One of the central issues in developing neighborhood search techniques is defining the neighborhood. As a rule of thumb, larger neighborhoods contain higher quality local optimal solutions compared to smaller neighborhoods. However, larger neighborhoods also typically require more time to search than smaller neighborhoods.
Douglas S. Altner +3 more
openaire +1 more source
Hybridization Based on Large Neighborhood Search
2016The type of algorithm addressed in this chapter is based on the following general idea. Given a valid solution to the tackled problem instance—henceforth called the incumbent solution—first, destroy selected parts of it, resulting in a partial solution. Then apply some other, possibly exact, technique to find the best valid solution on the basis of the
Christian Blum, Günther R. Raidl
openaire +1 more source
Evaluating the importance of randomization in adaptive large neighborhood search
International Transactions in Operational Research, 2016AbstractRandomization is common in many implementations of metaheuristics, and is typically a main ingredient while considering adaptive large neighborhood search (ALNS). This paper considers a standard implementation of ALNS for maritime pickup and delivery problems, identifies seven randomized components in that implementation, and proposes and ...
Ahmad Hemmati, Lars Magnus Hvattum
openaire +1 more source
Neighborhood based fast graph search in large networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, 2011Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labeled network and a query graph, how to efficiently search the query graph in the target network.
Arijit Khan 0001 +5 more
openaire +1 more source