The one-dimensional Ising model: mutation versus recombination

DOI10.1016/j.tcs.2005.04.002zbMath1079.68097MaRDI QIDQ2575079

Ingo Wegener, Simon Fischer

Publication date: 5 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.04.002

zbMATH Keywords

Ising model; evolutionary algorithms; expected optimization time; randomized local search

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems, Running time analysis of ant colony optimization for shortest path problems, Crossover can be constructive when computing unique input-output sequences, An analysis on recombination in multi-objective evolutionary optimization, Evolutionary algorithms and matroid optimization problems, Memetic algorithms outperform evolutionary algorithms in multimodal optimisation, Symmetry breaking for voting mechanisms, Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem, On the benefits and risks of using fitness sharing for multimodal optimisation, Do additional target points speed up evolutionary algorithms?

Cites Work

• On the analysis of the \((1+1)\) evolutionary algorithm
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• Real royal road functions -- where crossover provably is essential
• Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item