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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2017
020040060080019732017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
This paper shows how the performance of evolutionary multiobjective optimization (EMO) algorithms can be improved by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper develops a framework for optimizing global-local hybrids of search or optimization procedures. The paper starts by… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In this paper, we propose a hybrid algorithm for finding a set of nondominated solutions of a multi-objective optimization… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
1997
Highly Cited
1997
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper presents a probabilistic technique to diversify, intensify and parallelize a local search adapted for solving vehicle… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
It has recently been shown that local search is sur prisingly good at nding satisfying assignments for certain computationally… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain classes of CNF… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
One of the few general approaches to difficult combinatorial optimization problems that has met with empirical success is local… (More)
Is this relevant?