Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
3-optAlgorithmAnytime algorithmApproximation algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
A hybrid metaheuristic case-based reasoning system for nurse rostering
In this paper we present a novel Case-Based Reasoning (CBR) system called CABAROST (CAsed-BAsed ROSTering) which was developed… 
Highly Cited
2007
Highly Cited
2007
Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem
The course timetabling problem deals with the assignment of a set of courses to specific timeslots and rooms within a working… 
Highly Cited
2007
Highly Cited
2007
A scatter search-based heuristic to locate capacitated transshipment points
Highly Cited
2003
Highly Cited
2003
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational… 
Highly Cited
2003
Highly Cited
2003
On the deployment of picocellular wireless infrastructure
Wireless LANs are becoming increasingly common in both home and office networks. Additionally, wireless Internet service… 
Highly Cited
2001
Highly Cited
2001
Convex Optimization Methods for Sensor Node Position Estimation
Highly Cited
2000
Highly Cited
2000
The new model of parallel genetic algorithm in multi-objective optimization problems - divided range multi-objective genetic algorithm
Proposes a divided-range multi-objective genetic algorithm (DRMOGA), which is a model for the parallel processing of genetic… 
Highly Cited
1999
Highly Cited
1999
The permutation flow shop with buffers: A tabu search approach
Highly Cited
1997
Highly Cited
1997
Implementation and Computational Results
In the literature (see, e.g. Bertsimas and Tsitsiklis [1994], Chvatal [1983] and Garfinkel and Nemhauser [1972]), a number of… 
Highly Cited
1987
Highly Cited
1987
Heuristic methods for flexible flow line scheduling
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)