Skip to main content
SpringerLink
Log in

Very Large-Scale Neighborhood Search

  • Chapter
  • First Online:
Search Methodologies

Abstract

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. A neighborhood search algorithm is not practical if the neighborhoods cannot be searched efficiently. Thus, a rapid search algorithm is needed to make efficient use of large neighborhoods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Abdullah S, Ahmadi S, Burke EK, Dror M, McCollum B (2007) A tabu-based large neighborhood search methodology for the capacitated examination timetabling problem. J Oper Res Soc 58:1494–1502

    Article  Google Scholar 

  • Agarwal R, Ahuja RK, Laporte G, Shen ZJ (2003) A composite very large-scale neighborhood search algorithm for the vehicle routing problem. In: Leung, JY-T (ed) Handbook of scheduling: algorithms, models and performance analysis. CRC, Boca Raton, pp 49-01–49-23

    Google Scholar 

  • Ahuja RK, Orlin JB, Sharma D (2001) Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math Program 91:71–97

    Google Scholar 

  • Ahuja RK, Ergun Ö, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discret Appl Math 123:75–102

    Article  Google Scholar 

  • Ahuja RK, Orlin JB, Sharma D (2003) A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Oper Res Lett 31:185–194

    Article  Google Scholar 

  • Ahuja RK, Liu J, Orlin JB, Goodstein J, Mukherjee A (2004a) A neighborhood search algorithm for the combined through fleet assignment model with time windows. Networks 44:160–171

    Article  Google Scholar 

  • Ahuja RK, Orlin JB, Pallottino S, Scaparra MP, Scutellá MG (2004b) A multi-exchange heuristic for the single source capacitated facility location. Manag Sci 50:749–760

    Article  Google Scholar 

  • Ahuja RK, Goodstein J, Mukherjee A, Orlin JB, Sharma D (2007a) A very large-scale neighborhood search algorithm for the combined through-fleet assignment model. INFORMS J Comput 19:416–428

    Article  Google Scholar 

  • Ahuja RK, Jha KC, Liu J (2007b) Solving real-life railroad blocking problems. Interfaces 37:404–419

    Article  Google Scholar 

  • Ahuja RK, Jha KC, Orlin JB, Sharma D (2007c) A very large-scale neighborhood search algorithm for the quadratic assignment problem. INFORMS J Comput 19:646–657

    Article  Google Scholar 

  • Ahuja RK, Huang W, Romeijn HE, Morales DR (2007d) A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints. INFORMS J Comput 19:14–26

    Article  Google Scholar 

  • Ahuja RK, Kumar A, Jha KC, Orlin JB (2008) Exact and heuristic algorithms for the weapon-target assignment problem. Oper Res 55:1136–1146

    Article  Google Scholar 

  • Alba E (2005) Parallel metaheuristics: a new class of algorithms. Wiley, New York

    Book  Google Scholar 

  • Altner DS, Ahuja RK, Ergun Ö, Orlin JB (2010) Very large-scale neighborhood search. In: Cochranm JJ (ed) Wiley Encyclopedia of operations research and management science. Wiley, New York

    Google Scholar 

  • Ambrosino D, Sciomachen A, Scutellá MG (2009) A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem. Comput Oper Res 36:442–460

    Article  Google Scholar 

  • Barnes JW, Wiley VD, Moore JT, Ryer DM (2004) Solving the aerial fleet refueling problem using group theoretic tabu search. Math Comput Model 39:617–648

    Article  Google Scholar 

  • Bompadre A, Orlin JB (2005) Using grammars to generate very large-scale neighborhoods for the traveling salesman problem and other sequencing problems. In: Integer programming and combinatorial optimization. LNCS 3509. Springer, Berlin, pp 437–451

    Google Scholar 

  • Colletti BW, Barnes JW (2005) Using group theory to construct and characterize metaheuristic search neighborhoods. In: Alidaee B, Rego C (eds) Metaheuristic optimization via memory and evolution. Springer, Berlin, pp 303–328

    Chapter  Google Scholar 

  • Congram RK, Potts CN, van de Velde SL (2002) An iterated dynasearch algorithm for the single machine total weighted tardiness scheduling problem. INFORMS J Comput 14:52–67

    Article  Google Scholar 

  • Crino JR, Moore JT, Barnes JW, Nanry WP (2004) Solving the theater distribution vehicle routing and scheduling problem using group theoretic tabu search. Math Comput Model 39:599–616

    Article  Google Scholar 

  • Cunha CB, Ahuja RK (2005) Very large-scale neighborhood search for the K-constrained multiple knapsack problem. J Heuristics 11:465–481

    Article  Google Scholar 

  • Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math Program 102:71–90

    Article  Google Scholar 

  • Davenport A, Kalagnanam J, Reddy C, Siegel S, Hou J (2007) An application of constraint programming to generating detailed operations schedules for steel manufacturing. In: Proceedings of the constraint programming, Providence, pp 64–75

    Google Scholar 

  • Dorndorf U, Pesch E (1994) Fast clustering algorithms. ORSA J Comput 6:141–153

    Article  Google Scholar 

  • Dror M, Levy L (1986) A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing. Comput Oper Res 13:33–45

    Article  Google Scholar 

  • Ergun Ö, Orlin JB, Steele-Feldman A (2006) Creating very large-scale neighborhoods out of smaller ones by compounding moves. J Heuristics 12:115–140

    Article  Google Scholar 

  • Frangioni A, Necciari E, Scutellá MG (2004) Multi-exchange algorithms for minimum makespan machine scheduling problems. J Comb Optim 8:195–220

    Article  Google Scholar 

  • Helsgaun K (2000) An effective implementation of the Lin–Kernighan traveling salesman heuristic. Eur J Oper Res 126:106–130

    Article  Google Scholar 

  • Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49:291–307

    Article  Google Scholar 

  • Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498–516

    Article  Google Scholar 

  • Mitrović-Minić S, Punnen AP (2009) Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem. Discret Optim 6:370–377

    Article  Google Scholar 

  • Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100

    Article  Google Scholar 

  • Pesant G, Gendreau M (1999) A constraint programming framework for local search methods. J Heuristics 5:255–279

    Article  Google Scholar 

  • Rego C, Roucairol C (1996) A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman IH, Kelly JP (eds) Metaheuristics: theory and applications. Kluwer, Norwell, pp 661–675

    Google Scholar 

  • Scaparra MP, Pallottino S, Scutellá MG (2004) Large-scale neighborhood heuristics for the capacitated vertex p-center problem. Networks 43:241–255

    Article  Google Scholar 

  • Sindhuchao S, Romeijn HE, Akcali E, Boondiskulchok R (2005) An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity. J Glob Optim 32:93–118

    Article  Google Scholar 

  • Thompson PM, Orlin JB (1989) The theory of cyclic transfers. Technical report OR 200-89, MIT

    Google Scholar 

  • Thompson PM, Psaraftis HN (1993) Cyclic transfer algorithms for multivehicle routingand scheduling problems. Oper Res 41:935–946

    Article  Google Scholar 

  • TSPLIB (2012) http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

  • Xu J, Kelly JP (1996) A network flow-based tabu search heuristic for the vehicle routing problem. Transp Sci 30:379–393

    Article  Google Scholar 

  • Yagiura M, Yamaguchi T, Ibaraki T (1999) A variable-depth search algorithm for the generalized assignment problem. In: Voss S et al (eds) Metaheuristics: advances and trends in local search paradigms for optimization. Kluwer, Norwell, pp 459–471

    Chapter  Google Scholar 

  • Yagiura M, Ibaraki T, Glover F (2004a) An ejection chain approach for the generalized assignment problem. INFORMS J Comput 16:133–151

    Article  Google Scholar 

  • Yagiura M, Iwasaki S, Ibaraki T, Glover F (2004b) A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discret Optim 1:87–98

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, United States Naval Academy, Annapolis, MD, USA

    Douglas S. Altner

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Ravindra K. Ahuja

  3. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA

    Özlem Ergun

  4. Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA

    James B. Orlin

Authors
  1. Douglas S. Altner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ravindra K. Ahuja
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Özlem Ergun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. James B. Orlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ravindra K. Ahuja .

Editor information

Editors and Affiliations

  1. Computing Science and Mathematics, University of Stirling, Scotland, United Kingdom

    Edmund K. Burke

  2. Research and Knowledge Transfer, University of Nottingham, Malaysia & UK, Semenyih, Malaysia

    Graham Kendall

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Altner, D.S., Ahuja, R.K., Ergun, Ö., Orlin, J.B. (2014). Very Large-Scale Neighborhood Search. In: Burke, E., Kendall, G. (eds) Search Methodologies. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-6940-7_13

Download citation

Publish with us

Policies and ethics

Search

Navigation