Tag Archives: simulated annealing
Another comparison of heuristic optimizers
A herd of heuristic algorithms is compared using a portfolio optimization. Previously “A comparison of some heuristic optimization methods” used two simple and tiny portfolio optimization problems to compare a number of optimization functions in the R language. This post expands upon that by using a portfolio optimization problem that is of a realistic size … Continue reading
A comparison of some heuristic optimization methods
A simple portfolio optimization problem is used to look at several R functions that use randomness in various ways to do optimization. Orientation Some optimization problems are really hard. In these cases sometimes the best approach is to use randomness to get an approximate answer. Once you decide to go down this route, you need … Continue reading
