Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Local search (optimization)

Known as: Local search algorithm, K-opt, K-Opt method 
In computer science, local search is a heuristic method for solving computationally hard optimization problems. Local search can be used on problems… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
This is a preliminary version of a chapter that appeared in the book Local Search in Combinatorial Optimization, E. H. L. Aarts… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Highly Cited
2008
Highly Cited
2008
  • N. Noman, H. Iba
  • IEEE Transactions on Evolutionary Computation
  • 2008
  • Corpus ID: 14725373
We propose a crossover-based adaptive local search (LS) operation for enhancing the performance of standard differential… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Highly Cited
2003
Highly Cited
2003
This paper shows how the performance of evolutionary multiobjective optimization (EMO) algorithms can be improved by… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2002
Highly Cited
2002
Abstract The paper presents a new genetic local search (GLS) algorithm for multi-objective combinatorial optimization (MOCO). The… Expand
  • figure 1
  • figure 4
  • table 1
  • figure 5
  • figure 6
Review
2001
Review
2001
Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly… Expand
Highly Cited
1999
Highly Cited
1999
From the Publisher: A meta-heuristic is an iterative master process that guides and modifies the operations of subordinate… Expand
Highly Cited
1999
Highly Cited
1999
Inspired by a method by Jones et al. (1993), we present a global optimization algorithm based on multilevel coordinate search. It… Expand
  • figure 1
Highly Cited
1997
Highly Cited
1997
From the Publisher: In the past three decades local search has grown from a simple heuristic idea into a mature field of… Expand
Review
1995
Review
1995
computational bounds for local search in combinatorial local search algorithms for combinatorial problems local search algorithms… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1985
Highly Cited
1985
We investigate the complexity of finding locally optimal solutions to NP-hard combinatorial optimization problems. Local… Expand