Large Derivations, Evolutionary Computation and Comparisons of Algorithms

Authors:
Olivier François
Affiliations:
-
Venue:
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Year:
2000

Citing 10
Cited 0

Cooling schedules for optimal annealing

Mathematics of Operations Research
Simulated annealing & boltzmann Machines: a stochastic approach to combinatorialoptimization & neural computing

Simulated annealing & boltzmann Machines: a stochastic approach to combinatorialoptimization & neural computing
Markov chains with rare transitions and simulated annealing

Mathematics of Operations Research
Parallel recombinative simulated annealing: a genetic algorithm

Parallel Computing
Cycle Decompositions and Simulated Annealing

SIAM Journal on Control and Optimization
Finite Markov chain results in evolutionary computation: a tour d'horizon

Fundamenta Informaticae
Statistical dynamics of the Royal Road genetic algorithm

Theoretical Computer Science - Special issue on evolutionary computation
Massively parallel simulated annealing and its relation to evolutionary algorithms

Evolutionary Computation
An evolutionary strategy for global minimization and its Markovchain analysis

IEEE Transactions on Evolutionary Computation
A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper summarizes large deviations results for Markov chains with exponential transitions, and discusses their applications in comparing stochastic optimization algorithms. In the second half, two specific algorithms will be focussed on: Mutation/Selection vs parallel simulated annealing. Conditions which tell when an algorithm should be preferred to the other will be given. These conditions combine the parameters of both algorithms and a number of relevant geometric quantities.