Theory of Local Search

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.

[1]  Berthold Vöcking,et al.  Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP , 2007, SODA '07.

[2]  Abraham P. Punnen,et al.  Approximate local search in combinatorial optimization , 2004, SODA '04.

[3]  Asaf Levin,et al.  Nonoblivious 2-Opt heuristics for the traveling salesman problem , 2013, Networks.

[4]  John Fearnley,et al.  The Complexity of the Simplex Method , 2015, STOC.

[5]  Pierre Hansen,et al.  Algorithms for the maximum satisfiability problem , 1987, Computing.

[6]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Emile H. L. Aarts,et al.  Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[8]  Kenneth Steiglitz,et al.  On the Complexity of Local Search for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[9]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[10]  Spencer L Gordon,et al.  The complexity of continuous local search , 2017 .

[11]  Burkhard Monien,et al.  Local Search: Simple, Successful, But Sometimes Sluggish , 2010, ICALP.

[12]  Andreas S. Schulz,et al.  0/1-Integer Programming: Optimization and Augmentation are Equivalent , 1995, ESA.

[13]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  Dániel Marx,et al.  Searching the k-change neighborhood for TSP is W[1]-hard , 2008, Oper. Res. Lett..

[15]  Christos Papadimitriou,et al.  Algorithms, complexity, and the sciences , 2014, Proceedings of the National Academy of Sciences.

[16]  V. Zissimopoulos,et al.  Local Search: Complexity and Approximation , 2014 .

[17]  Craig A. Tovey,et al.  New Results on the Old k-opt Algorithm for the Traveling Salesman Problem , 1999, SIAM J. Comput..

[18]  S. T. Fischer.  A Note on the Complexity of Local Search Problems , 1995, Inf. Process. Lett..

[19]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[20]  Rolf Niedermeier,et al.  The Parameterized Complexity of Local Search for TSP, More Refined , 2011, Algorithmica.