IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-032-00385-0_6.html
   My bibliography  Save this book chapter

Theory of Local Search

In: Handbook of Heuristics

Author

Listed:
  • W. Michiels

    (NXP
    Eindhoven University of Technology)

  • E. H. L. Aarts

    (Tilburg University)

  • J. Korst

    (Philips Research Laboratories)

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.

Suggested Citation

  • W. Michiels & E. H. L. Aarts & J. Korst, 2025. "Theory of Local Search," Springer Books, in: Rafael Martí & Panos M. Pardalos & Mauricio G.C. Resende (ed.), Handbook of Heuristics, edition 0, chapter 17, pages 469-509, Springer.
    • Handle: RePEc:spr:sprchp:978-3-032-00385-0_6
    DOI: 10.1007/978-3-032-00385-0_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-032-00385-0_6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.