Skip to search formSkip to main contentSkip to account menu

Iterated local search

Iterated Local Search (ILS) is a term in applied mathematics and computer sciencedefining a modification of local search or hill climbing methods for… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Combinatorial optimizationComputer scienceFeature selectionHill climbing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
We present a highly effective dynamic programming driven memetic algorithm for the Steiner tree problem with revenues, budget… 
2012
2012
Iterated Local Search for the Traveling Tournament Problem
The problem of finding optimal schedules for professional sports leagues has attracted interests of many researchers in recent… 
2010
2010
Optimizing Educational Schedules Using Hungarian Algorithm and Iterated Local Search
In this paper a technique called No-Collision-Principle will be introduced to avoid hard-constraint violations of resources in an… 
2009
2009
Improvements for multi-objective flow shop scheduling by Pareto Iterated Local Search
The article describes the proposition and application of a local search metaheuristic for multi-objective optimization problems… 
2008
2008
Iterated Local Search for the Multiple Depot Vehicle Scheduling Problem
The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important problem arising in public transport. Although… 
2008
2008
A Branch-and-Cut Algorithm for the Non-Preemptive Capacitated Swapping Problem
This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete… 
2007
2007
Variable depth search and iterated local search for the node placement problem in multihop WDM lightwave networks
We address a problem of finding an optimal node placement that minimizes the amount of traffics by reducing the weighted hop… 
2006
2006
An iterated local search heuristic for a capacitated hub location problem
This paper addresses a capacitated hub problem consisting of choosing the routes and the hubs to use in order to send a set of… 
2005
2005
On metaheuristic "failure modes": a case study in Tabu search for job-shop scheduling.
Disclosed are two embodiments (40, 50) of a self-locking prevailing torque fastener featuring a common base portion (2) having an… 
2001
2001
Local search and metaheuristics for the quadratic assignment problem
The quadratic assignment problem (QAP) is an important problem in theory and practice. It was , which was introduced by Koopmans… 
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)