Simulated annealing
Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search space for an optimization problem. It is often used when the search space is discrete (e.g., the traveling salesman problem). For problems where finding an approximate global optimum is more important than finding a precise local optimum in a fixed amount of time, simulated annealing may be preferable to exact algorithms such as gradient descent, Branch and Bound.
https://en.wikipedia.org/wiki/Simulated_annealing
Views
Default
Arbre
Pannellum
VK-slides
KuM-slides
Knoids
Presentation
Textrec
Recview
Repetitio
Bildung
Reveal
Impress
HTML ?
Axones
-
X Simulated annealing is_parent of Simulated Annealing :: What it does (ID: 11862 :: weight 90) :: TEXTREC ::
-
X Simulated annealing is_parent of S.A. exercise: Rocket launch revisited (ID: 11867 :: weight 80) :: TEXTREC ::https://bleuje.github.io/p5js-myprojects/rocket-optimization-sa/index.html
-
X Simulated annealing is_parent of Simulated Annealing :: Exercise (ID: 11866 :: weight 1) :: TEXTREC ::You will be divided into two break-out rooms, each group will include at least two Python ninjas.
Task: transform Maurice's Genetic algorithm for detection of furthest point into Simulated Annealing form
Hint: check https://docs.scipy.org/doc/scipy-0.14.0/reference/generated/scipy.optimize.anneal.html
Zeitgeist Log
2020-10-12 15:09:26.378816 daniel-hromada@medienhaus.udk-berlin.de executed add_bound with variables "obj"=>"10497", "ord"=>"1", "sub"=>"10257", "bound_id"=>"23365", "predicate"=>"is_parent"
2021-01-12 10:19:55.601428 daniel-hromada@medienhaus.udk-berlin.de executed add_bound with variables "obj"=>"11862", "ord"=>"1", "sub"=>"10497", "bound_id"=>"25419", "predicate"=>"is_parent"
2021-01-12 10:21:11.192833 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables
2021-01-12 11:24:49.197743 daniel-hromada@medienhaus.udk-berlin.de executed add_bound with variables "obj"=>"11864", "ord"=>"1", "sub"=>"10497", "bound_id"=>"25423", "predicate"=>"is_parent"
2021-01-12 11:25:18.780732 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables
2021-01-12 11:32:31.926188 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables
2021-01-12 11:33:22.666451 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables
2021-01-12 11:36:20.147866 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables
2021-01-12 11:38:53.522396 daniel-hromada@medienhaus.udk-berlin.de executed add_bound with variables "obj"=>"11865", "ord"=>"1", "sub"=>"10497", "bound_id"=>"25425", "predicate"=>"is_parent"
2021-01-12 11:39:05.851055 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables
2021-01-12 11:41:57.849925 daniel-hromada@medienhaus.udk-berlin.de executed add_bound with variables "obj"=>"11866", "ord"=>"1", "sub"=>"10497", "bound_id"=>"25427", "predicate"=>"is_parent"
2021-01-12 11:42:15.98905 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables
2021-01-12 11:47:15.776249 daniel-hromada@medienhaus.udk-berlin.de executed add_bound with variables "obj"=>"11867", "ord"=>"1", "sub"=>"10497", "bound_id"=>"25429", "predicate"=>"is_parent"
2021-01-12 11:47:18.161755 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables
2021-01-12 11:51:25.705761 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables
2021-01-12 11:52:06.483396 daniel-hromada@medienhaus.udk-berlin.de executed /view/10497/ with variables