## 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.

Original language | English |
---|---|

Title of host publication | Handbook of heuristics |

Editors | R. Martí, P. Pardalos, M. Resende |

Place of Publication | Cham |

Publisher | Springer |

Pages | 299-339 |

Number of pages | 41 |

ISBN (Electronic) | 978-3-319-07124-4 |

ISBN (Print) | 978-3-319-07123-7 |

DOIs | |

Publication status | Published - 13 Aug 2018 |

## Keywords

- Iterative improvement
- Performance ratio
- PLS
- Time complexity