Results 251 to 260 of about 10,004,845 (289)

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   +2 more sources

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   +2 more sources

A survey of adaptive large neighborhood search algorithms and applications

Computers & Operations Research, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Setyo Tri Windras Mara, Rachmadi Norcahyo, Panca Jodiawan, Luluk Lusiantoro, Achmad Pratama Rifai   +4 more
openaire   +1 more source

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
exaly   +4 more sources

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 0001, Pascal Van Hentenryck   +1 more
openaire   +2 more sources

Adaptive large neighborhood search for scheduling of mobile robots

Proceedings of the Genetic and Evolutionary Computation Conference, 2019
Our 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, Hana Rudová, Cong Thanh Nguyen   +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

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

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 0001, Nan Li, Xifeng Yan, Ziyu Guan, Supriyo Chakraborty, Shu Tao   +5 more
openaire   +1 more source

Large Neighborhood Search for Temperature Control with Demand Response

2020
Demand response is a control problem that optimizes the operation of electrical loads subject to limits on power consumption during times of low power supply or extreme power demand. This paper studies the demand response problem for centrally controlling the space conditioning systems of several buildings connected to a microgrid. The paper develops a
Edward Lam 0001, Frits de Nijs, Peter J. Stuckey, Donald Azuatalam, Ariel Liebman   +4 more
openaire   +2 more sources