Results 261 to 270 of about 450,572 (276)

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, Paul Shaw, Vincent Furnon   +2 more
openaire   +1 more source

Very Large-Scale Neighborhood Search

2013
One 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, Ravindra K. Ahuja, Özlem Ergun, James B. Orlin   +3 more
openaire   +1 more source

Large neighborhood search for LNG inventory routing

Journal of Heuristics, 2012
Liquefied 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, Kevin C. Furman, Jin-Hwa Song, Amr S. El-Bakry   +3 more
openaire   +1 more source

MaxSAT-based large neighborhood search for high school timetabling

Computers & Operations Research, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Demirović, Emir, Musliu, Nysret
openaire   +2 more sources

Hybridization Based on Large Neighborhood Search

2016
The 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

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, DI GASPERO, Luca, DOVIER, Agostino   +2 more
openaire   +2 more sources

Large neighborhood search for break scheduling

2016
A high a level of concentration is essential in certain working areas such as in air traffic control, assembly line works or supervision. In such areas breaks are mandatory to avoid fatal errors. Breaks are regulated due to safety rules or legal demands. The break scheduling problem (Bsp) deals with these kind of regulations.
openaire   +1 more source

Neighborhood based fast graph search in large networks

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, 2011
Complex 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, Nan Li, Xifeng Yan, Ziyu Guan, Supriyo Chakraborty, Shu Tao   +5 more
openaire   +1 more source

Large Neighborhood Search for Dial-a-Ride Problems

2011
Dial-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, Pascal Van Hentenryck
openaire   +1 more source

A Large Neighborhood Search Heuristic for Graph Coloring

2007
We 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