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

Guided Local Search

Known as: GLS 
Guided Local Search is a metaheuristic search method. A meta-heuristic method is a method that sits on top of a local search algorithm to change its… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Due to the exponential growth of textual information available on the Web, end users need to be able to access information in… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In the team orienteering problem (TOP) a set of locations is given, each with a score. The goal is to determine a fixed number of… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The collection of waste is a highly visible and important municipal service that involves large expenditures. Waste collection… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a new and effective metaheuristic algorithm, active guided evolution strategies, for the vehicle routing problem with… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Guided Local Search (GLS) is an intelligent search scheme for combinatorial optimization problems. A main feature of the approach… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Abstract This paper presents a new local search algorithm for the capacitated arc routing problem (CARP). The procedure uses… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The three-dimensional bin-packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present a learning framework for Markovian decision processes that is based on optimization in the policy space. Instead of… Expand
  • figure 2
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Abstract The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. In this paper, we… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Many recently developed local search procedures for job shop scheduling use interchange of operations, embedded in a simulated… Expand
Is this relevant?