Skip to main content
SpringerLink
Log in

Theory of Local Search

  • Reference work entry
  • First Online:
Handbook of Heuristics

Abstract

Local search is a widely used method to solve combinatorial optimization problems. As many relevant combinatorial optimization problems are NP-hard, we often may not expect to find an algorithm that is guaranteed to return an optimal solution in a reasonable amount of time, i.e., in polynomial time. Therefore, one often resorts to heuristic methods that return good, suboptimal solutions in reasonable running times. Local search is a heuristic method that is popular for its ability to trade solution quality against computation time. By spending more time, we will generally get better solutions. Well-known examples of local search approaches are iterative improvement, simulated annealing, and tabu search.

The performance of local search, in terms of quality or running time, may be investigated empirically, probabilistically, and from a worst-case perspective. In this chapter we focus on the last option. That is, we give provable results on the worst-case performance of local search algorithms.

Besides combinatorial optimization problems, the theory discussed in this chapter also finds its application in game theory and computational complexity.

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 999.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,199.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

  1. Angel E, Christopoulos P, Zissimopoulos V (2014) Local search: complexity and approximation. In: Paschos VT (ed) Paradigms of combinatorial optimization: problems and new approaches, vol 2. Wiley, Hoboken, pp 435–471

    Google Scholar 

  2. Chandra B, Karloff H, Tovey C (1999) New results on the old k-opt algorithm for the traveling salesman problem. SIAM J Comput 28:1998–2029

    Google Scholar 

  3. Christofides N (1976) Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, 388. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh

    Google Scholar 

  4. Englert M, Röglin H, Vöcking B (2007) Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. In: Proceedings of the 18th ACM-SIAM symposium on discrete algorithm, New Orleans, pp 1295–1304

    Google Scholar 

  5. Fearnley J, Savani R (2015) The complexity of the simplex method. In: Proceedings of the forty-seventh annual ACM symposium on theory of computing, pp 201–208

    Google Scholar 

  6. Fischer S (1995) A note on the complexity of local search problems. Inf Process Lett 53:69–75

    Google Scholar 

  7. Gordon S (2017) The complexity of continuous local search. Master thesis, University of Illinois

    Google Scholar 

  8. Guo J, Hartung S, Niedermeier R, Suchý O (2013) The parameterized complexity of local search for TSP, more refined. Algorithmica 67:89–110

    Google Scholar 

  9. Hansen P, Jaumard B (1990) Algorithms for the maximum satisfiability problem. Computing 44:279–303

    Google Scholar 

  10. Johnson D, McGeoch L (1997) The traveling salesman problem: a case study. In: Aarts E, Lenstra J (eds) Local search in combinatorial optimization. Wiley, New York, pp 215–310

    Google Scholar 

  11. Johnson D, Papadimitriou C, Yannakakis M (1988) How easy is local search? J Comput Syst Sci 37:79–100

    Google Scholar 

  12. Khanna S, Motwani R, Sudan M, Vazirani U (1998) On syntactic versus computational views of approximability. SIAM J Comput 28:164–191

    Google Scholar 

  13. Levin A, Yovel U (2013) Nonoblivious 2-Opt heuristics for the traveling salesman problem. Networks 62(3):201–219

    Google Scholar 

  14. Luecker G (1976) unpublished manuscript. Department of Computer Science, Princeton University, Princeton

    Google Scholar 

  15. Marx D (2008) Searching the k-change neighborhood for TSP is w[1]-hard. Oper Res Lett 36:31–36

    Google Scholar 

  16. Michiels W, Aarts E, Korst J (2007) Theoretical aspects of local search. Springer, Berlin

    Google Scholar 

  17. Monien B, Dumrauf D, Tscheuschner T (2010) Local search: simple, successful, but sometimes sluggish. In: Automata, languages and programming, pp 1–17

    Google Scholar 

  18. Orlin J, Punnen A, Schulz A (2004) Approximate local search in combinatorial optimization. SIAM J Comput 33:1201–1214

    Article  MathSciNet  Google Scholar 

  19. Papadimitriou C (2014) Algorithms, complexity, and the sciences. Proc Natl Acad Sci 111:15881–15887

    Article  Google Scholar 

  20. Papadimitriou C, Steiglitz K (1977) On the complexity of local search for the traveling salesman problem. SIAM J Comput 6:76–83

    Article  MathSciNet  Google Scholar 

  21. Papadimitriou C, Steiglitz K (1982) Combinatorial optimization. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  22. Sahni S, Gonzalez T (1976) P-complete approximation problems. J Assoc Comput Mach 23:555–565

    Article  MathSciNet  Google Scholar 

  23. Schulz A, Weismantel R, Ziegler G (1995) 0/1-integer programming: optimization and augmentation are equivalent. In: Proceedings of the 3rd annual European symposium on algorithms, Corfu, pp 473–483

    Google Scholar 

  24. Yannakakis M (1997) Computational complexity. In: Aarts E, Lenstra J (eds) Local search in combinatorial optimization. Wiley, New York, pp 19–55

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NXP, Eindhoven, The Netherlands

    W. Michiels

  2. Eindhoven University of Technology, Eindhoven, The Netherlands

    W. Michiels

  3. Tilburg University, Tilburg, The Netherlands

    E. H. L. Aarts

  4. Philips Research Laboratories, Eindhoven, The Netherlands

    J. Korst

Authors
  1. W. Michiels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. H. L. Aarts
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Korst
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to W. Michiels .

Editor information

Editors and Affiliations

  1. Statistics and Operations Research Department, University of Valencia, Valencia, Spain

    Rafael Martí

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

    Panos M. Pardalos

  3. Amazon.com, Inc. and University of Washington, Seattle, Washington, USA

    Mauricio G. C. Resende

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Michiels, W., Aarts, E.H.L., Korst, J. (2018). Theory of Local Search. In: Martí, R., Pardalos, P., Resende, M. (eds) Handbook of Heuristics. Springer, Cham. https://doi.org/10.1007/978-3-319-07124-4_6

Download citation

Publish with us

Policies and ethics

Search

Navigation