Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Iterated_local_search> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Iterated_local_search abstract "Iterated Local Search (ILS) is a term in applied mathematics and computer sciencedefining a modification of local search or hill climbing methods for solving discrete optimization problems.Local search methods can get stuck in a local minimum, whereno improving neighbors are available.A simple modification consists of iterating calls to the local search routine,each time starting from a different initial configuration. This is called repeated local search, and implies that the knowledge obtained during the previous local search phasesis not used.Learning implies that the previous history, for example the memory about the previously found local minima, is mined to produce better and better starting points for local search.The implicit assumption is that of a clustered distribution of local minima: when minimizing a function, determining good local minima is easier when starting from a local minimum with a low value than when starting from a random point. The only caveat is to avoid confinement in a given attraction basin, so that the kick to transform a local minimizer into the starting point for the next run has to be appropriately strong, but not too strong to avoid reverting to memory-less random restarts.Iterated Local Search is based on building a sequence of locally optimal solutions by: perturbing the current local minimum; applying local search after starting from the modified solution.The perturbation strength has to be sufficient to lead the trajectory to a differentattraction basin leading to a different local optimum.The method has been applied to several Combinatorial Optimization Problems including the Job-Shop Scheduling Problems, Flow-Shop Problems, Vehicle Routing Problems as well as many others.References".
- Iterated_local_search thumbnail Iterated_local_search.png?width=300.
- Iterated_local_search wikiPageID "30155625".
- Iterated_local_search wikiPageRevisionID "594264666".
- Iterated_local_search hasPhotoCollection Iterated_local_search.
- Iterated_local_search subject Category:Optimization_algorithms_and_methods.
- Iterated_local_search type Abstraction100002137.
- Iterated_local_search type Act100030358.
- Iterated_local_search type Activity100407535.
- Iterated_local_search type Algorithm105847438.
- Iterated_local_search type Event100029378.
- Iterated_local_search type OptimizationAlgorithmsAndMethods.
- Iterated_local_search type Procedure101023820.
- Iterated_local_search type PsychologicalFeature100023100.
- Iterated_local_search type Rule105846932.
- Iterated_local_search type YagoPermanentlyLocatedEntity.
- Iterated_local_search comment "Iterated Local Search (ILS) is a term in applied mathematics and computer sciencedefining a modification of local search or hill climbing methods for solving discrete optimization problems.Local search methods can get stuck in a local minimum, whereno improving neighbors are available.A simple modification consists of iterating calls to the local search routine,each time starting from a different initial configuration.".
- Iterated_local_search label "Iterated local search".
- Iterated_local_search sameAs m.0g59x6r.
- Iterated_local_search sameAs Q6094397.
- Iterated_local_search sameAs Q6094397.
- Iterated_local_search sameAs Iterated_local_search.
- Iterated_local_search wasDerivedFrom Iterated_local_search?oldid=594264666.
- Iterated_local_search depiction Iterated_local_search.png.
- Iterated_local_search isPrimaryTopicOf Iterated_local_search.
