Local search based heuristics for global optimization: Atomic clusters and beyond
- 作者：Marco Locatellia ; locatell@ce.unipr.it ; Fabio Schoenb ; fabio.schoen@unifi.it
- 关键词：Global Optimization ; Neighborhood structures ; Diversification ; Basin Hopping ; Population based methods ; Atomic clusters
- 刊名：European Journal of Operational Research
- 出版年：2012
- 期刊代码：58_03772217
- 类别：et
- 出版时间：1 October, 2012
- 卷：222
- 期：1
- 页码：1-9
- 文件大小：245 K
摘要
Finding good solutions to large scale, hard, global optimization problems, is a demanding task with many relevant applications. It is well known that, in order to tackle a difficult problem, an algorithm has to incorporate all of the available information on the problem domain. However, as we will show in this paper, some general purpose methods and the ideas on which they are built can provide guidance towards the efficient solution of difficult instances. Most of this paper will be devoted to heuristic techniques applied to the problem of finding a minimum energy configuration of a cluster of atoms in . This is a very relevant problem with a large set of applications which has triggered considerable research efforts in the last decade. We will show how some relatively simple ideas can be used to generate fairly efficient methods which have been employed to discover many new cluster structures. In this paper we will introduce some of the main algorithmic ideas which have proven to be particularly successful in the field of global optimization applied to atomic cluster conformation problems. We will mainly discuss Basin Hopping methods, as well as their population-based variant, and some specific technique based on 鈥渄irect moves鈥? These methods, although designed for the specific problem, have a much wider applicability. In fact, one of the aims of this paper is also that of suggesting that similar ideas can be employed in order to design innovative methods even for totally different global optimization problems, like, e.g., circle packing and space trajectory planning.