English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30540
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Title

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

AuthorsBofill, Pau; Guimerà, Roger; Torras, Carme
KeywordsBlock designs
Neural cost functions
Higher-order connections
Simulated annealing
Mean field annealing
Optimisation
Issue Date2003
PublisherElsevier
CitationNeural Networks 16(10): 1421-1428 (2003)
AbstractThis 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.
Publisher version (URL)http://dx.doi.org/10.1016/j.neunet.2003.07.003
Preprint
URIhttp://hdl.handle.net/10261/30540
DOI10.1016/j.neunet.2003.07.003
ISSN0893-6080
Appears in Collections:(IRII) Artículos
Files in This Item:
File Description SizeFormat 
Comparison of simulated annealing.pdf260,11 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.