Comparison of simulated annealing and mean field annealing as applied to the generation of block designs

Authors:
Pau Bofill;Roger Guimerà;Carme Torras
Affiliations:
Departament d'Arquitectura de Computadors, Universitat Politècnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain;Departament d'Enginyeria Química, Universitat Rovira i Virgili, Autovia de Salou s/n, 43006 Tarragona, Spain;Institut de Robòtica i Informàtica Industrial (CSIC-UPC), Parc Tecnològic de Barcelona-Edifici U, c/Llorens i Artigas 4-6, 08028 Barcelona, Spain
Venue:
Neural Networks
Year:
2003

Citing 14
Cited 1

Combinatorics of experimental design

Combinatorics of experimental design
Higher-order Boltzmann machines

AIP Conference Proceedings 151 on Neural Networks for Computing
Neural networks and NP-complete optimization problems; a performance study on the graph bisection problem

Complex Systems
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Introduction to the theory of neural computation

Introduction to the theory of neural computation
Chaotic simulated annealing by a neural network model with transient chaos

Neural Networks
Minimization of MRF Energy with Relaxation Labeling

Journal of Mathematical Imaging and Vision
Combinatorial theory (2nd ed.)

Combinatorial theory (2nd ed.)
A fast neural-network algorithm for VLSI cell placement

Neural Networks
Exploiting symmetries within constraint satisfaction search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Figure-Ground Discrimination: A Combinatorial Optimization Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving Strategies for Highly Symmetric CSPs

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Traffic management of a satellite communication network using stochastic optimization

IEEE Transactions on Neural Networks
A unified framework for chaotic neural-network approaches to combinatorial optimization

IEEE Transactions on Neural Networks

Finding Balanced Incomplete Block Designs with Metaheuristics

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an experimental comparison between a discrete stochastic optimization procedure (Simulated Annealing, SA) and a continuous deterministic one (Mean Field Annealing), as applied to the generation of Balanced Incomplete Block Designs (BIBDs). A neural cost function for BIBD generation is proposed with connections of arity four, and its continuous counterpart is derived as required by the mean field formulation. Both strategies are optimized with regard to the critical temperature, and the expected cost to the first solution is used as a performance measure for the comparison. The results show that SA performs slightly better, but the most important observation is that the pattern of difficulty across the 25 problem instances tried is very similar for both strategies, implying that the main factor to success is the energy landscape, rather than the exploration procedure used.