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.
Review
2019
Review
2019
Abstract In population-based optimization algorithms (POAs), given an optimization problem, the quality of the solutions depends… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
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
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We analyze local search heuristics for the metric k-median and facility location problems. We define the locality gap of a local… Expand
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Find loads of the stochastic local search foundations and applications book catalogues in this site as the choice of you visiting… Expand
Is this relevant?
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
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We use a local search method we term Large Neighbourhood Search (LNS) to solve vehicle routing problems. LNS is analogous to the… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
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
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This article presents a probabilistic technique to diversify, intensify, and parallelize a local search adapted for solving… Expand
  • 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 surprisingly good at finding satisfying assignments for certain computationally… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
We investigate the complexity of finding locally optimal solutions to NP-hard combinatorial optimization problems. Local… Expand
Is this relevant?