Large Neighborhood Search

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 promising search path. Starting from the large neighborhood search method, we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood search.

[1]  Fred W. Glover,et al.  Data structures and ejection chains for solving large-scale traveling salesman problems , 2005, Eur. J. Oper. Res..

[2]  Wim Nuijten,et al.  Randomized Large Neighborhood Search for Cumulative Scheduling , 2005, ICAPS.

[3]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

[4]  Gérard Cornuéjols,et al.  Halin graphs and the travelling salesman problem , 1983, Math. Program..

[5]  Gerhard J. Woeginger,et al.  Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines , 2006, Electron. Notes Discret. Math..

[6]  Michel Gendreau,et al.  Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries , 2006 .

[7]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[8]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[9]  William M. Springer.  Review of the traveling salesman problem: a computational study by Applegate, Bixby, Chvátal, and Cook (Princeton University Press) , 2009, SIGA.

[10]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[11]  Abraham P. Punnen.  The traveling salesman problem: new polynomial approximation algorithms and domination analysis , 2001 .

[12]  David Pisinger,et al.  A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times , 2012, Eur. J. Oper. Res..

[13]  Michel Gendreau,et al.  A dynamic vehicle routing problem with multiple delivery routes , 2011, Annals of Operations Research.

[14]  Gilbert Laporte,et al.  The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm , 2009, Math. Program..

[15]  Fred W. Glover,et al.  Ejection chain and filter-and-fan methods in combinatorial optimization , 2006, 4OR.

[16]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[17]  Laurent Perron,et al.  Parallel Large Neighborhood Search , 2003 .

[18]  Gilbert Laporte,et al.  Scheduling technicians and tasks in a telecommunications company , 2008, J. Sched..

[19]  Gregory Gutin,et al.  Local search heuristics for the multidimensional assignment problem , 2008, J. Heuristics.

[20]  Christian Artigues,et al.  LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search , 2004, Ann. Oper. Res..

[21]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[22]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[23]  Johann Hurink,et al.  Two very large-scale neighborhoods for single machine scheduling , 2007, OR Spectr..

[24]  D. Godard,et al.  Self-Adapting Large Neighborhood Search: Application to Single-Mode Scheduling Problems , 2007 .

[25]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

[26]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[27]  Olli Bräysy,et al.  Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..

[28]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[29]  François Laburthe,et al.  A Meta-Heuristic Factory for Vehicle Routing Problems , 1999, CP.

[30]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[31]  Jeffrey Mark Phillips,et al.  A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph , 1998, Inf. Process. Lett..

[32]  Asvin Goel,et al.  Vehicle Scheduling and Routing with Drivers' Working Hours , 2009, Transp. Sci..

[33]  Stefan Ropke.  Parallel large neighborhood search - a software framework , 2009 .

[34]  Matteo Fischetti,et al.  A new ILP-based refinement heuristic for Vehicle Routing Problems , 2006, Math. Program..

[35]  André Langevin,et al.  Synchronized arc routing for snow plowing operations , 2012, Comput. Oper. Res..

[36]  Russell Bent,et al.  A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2006, Comput. Oper. Res..

[37]  Fred W. Glover,et al.  A path relinking approach with ejection chains for the generalized assignment problem , 2006, Eur. J. Oper. Res..

[38]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[39]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[40]  Kjetil Fagerholt,et al.  A large neighbourhood search heuristic for ship routing and scheduling with split loads , 2010, Comput. Oper. Res..

[41]  Gilbert Laporte,et al.  The inventory-routing problem with transshipment , 2012, Comput. Oper. Res..

[42]  Volker Gruhn,et al.  A General Vehicle Routing Problem , 2008, Eur. J. Oper. Res..

[43]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[44]  L. W. Jacobs,et al.  Note: A local-search heuristic for large set-covering problems , 1995 .

[45]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[46]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[47]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

[48]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

[49]  Johann L. Hurink,et al.  Matching based exponential neighborhoods for parallel machine scheduling , 2005 .

[50]  Oli B. G. Madsen,et al.  The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches , 2009, Eur. J. Oper. Res..

[51]  Fred Glover.  New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

[52]  Richard F. Hartl,et al.  Adaptive large neighborhood search for service technician routing and scheduling problems , 2012, J. Sched..

[53]  Stefan Ropke.  Parallel Large Neighborhood search , 2010 .

[54]  Marc Uetz,et al.  Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows , 2005, Hybrid Metaheuristics.

[55]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[56]  Bo Guo,et al.  The capacitated vehicle routing problem with stochastic demands and time windows , 2011, Comput. Oper. Res..

[57]  Michael Thompson Paul.  Local search algorithms for vehicle routing and other combinatorial problems , 1988 .

[58]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009, Networks.

[59]  Pawel Winter.  Steiner problem in Halin networks , 1987, Discret. Appl. Math..

[60]  Russell Bent,et al.  A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2003, Comput. Oper. Res..

[61]  Laurent Flindt Muller,et al.  An Adaptive Large Neighborhood Search Algorithm for the Resource-constrained Project Scheduling Problem , 2009 .

[62]  Patrick Prosser,et al.  Guided Local Search for the Vehicle Routing Problem , 1997 .

[63]  G. Dueck.  New optimization heuristics , 1993 .

[64]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[65]  Roberto Musmanno,et al.  An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[66]  Kathryn A. Dowsland,et al.  Nurse scheduling with tabu search and strategic oscillation , 1998, Eur. J. Oper. Res..

[67]  Yuichi Nagata,et al.  A powerful route minimization heuristic for the vehicle routing problem with time windows , 2009, Oper. Res. Lett..

[68]  César Rego,et al.  An Experimental Evaluation of Ejection Chain Algorithms for the Traveling Salesman Problem , 2006 .

[69]  Dushyant Sharma,et al.  Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem , 2001, Math. Program..

[70]  Johann Hurink,et al.  Matching based very large-scale neighborhoods for parallel machine scheduling , 2011, J. Heuristics.

[71]  James B. Orlin,et al.  Creating very large scale neighborhoods out of smaller ones by compounding moves , 2006, J. Heuristics.

[72]  Jayant Kalagnanam,et al.  An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing , 2007, CP.

[73]  Russell Bent,et al.  A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..

[74]  Johann L. Hurink,et al.  Two exponential neighborhoods for single machine scheduling , 2005 .

[75]  J. Hurink.  An exponential neighborhood for a one-machine batching problem , 1999 .

[76]  Ravindra K. Ahuja,et al.  Very Large-Scale Neighborhood Search , 2011 .

[77]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[78]  Dushyant Sharma,et al.  New neighborhood search structures for the capacitated minimum spanning tree problem , 1998 .