Hysteretic Optimization
无序系统与神经网络
2009-11-07 v2
摘要
We propose a new optimization method based on a demagnetization procedure well known in magnetism. We show how this procedure can be applied as a general tool to search for optimal solutions in any system where the configuration space is endowed with a suitable `distance'. We test the new algorithm on frustrated magnetic models and the traveling salesman problem. We find that the new method successfully competes with similar basic algorithms such as simulated annealing.
引用
@article{arxiv.cond-mat/0109359,
title = {Hysteretic Optimization},
author = {G. Zarand and F. Pazmandi and K. F. Pal and G. T. Zimanyi},
journal= {arXiv preprint arXiv:cond-mat/0109359},
year = {2009}
}
备注
5 pages, 5 figures