A multi-populations multi-strategies differential evolution algorithm for structural optimization of metal nanoclusters
Introduction
Metallic nanoclusters (less than a few hundred atoms) have attracted increasing attention because of their unique properties and extensive applications in a diversity of fields such as physics, chemistry, biology, and engineering [1], [2], [3], [4]. Nowadays, the transition metal nanoclusters are of significant interest due to their potential uses in ultrahigh density magnetic recording materials [5], catalytic particles in the synthesis of carbon nanotubes [6], [7], [8], [9], and other applications in electronics and optics. Due to the ultrafine size, the nanoclusters may remain in a ‘liquid-like’ state at temperatures far below the bulk melting point, and their magnetic moments may exceed bulk values at cluster sizes of several hundred atoms [10]. Among the transition metal clusters, iron (Fe) and chromium (Cr) clusters are the primary target of many research groups owing to their important magnetic properties [11], [12], [13], low price, and good catalytic performance [14], [15], [16], [17], [18]. Since the magnetic and catalytic properties of Fe and Cr clusters are strongly dependent on their structures, investigation of the stable structures is crucial for understanding their physical and chemical properties.
Essentially, searching the stable structures of clusters is a typical global optimization problem [10]. The number of distinct structures corresponding to local minima on the potential energy surface (PES) of a cluster is expected to grow exponentially with the cluster size [19]. Therefore, the searching procedures are computationally expensive. To date, many methods have been developed to solve the global optimization problem. They can be mainly classified into two classes: Those who use the iteration of single solution and ones who adopt the evolution of one population of candidate structures. The representatives of the first class are Basin-hopping approach [20], [21], [22], [23], Monte Carlo algorithm [24], [25], [26], [27], [28] and dynamical lattice searching (DLS) method [29], [30]. These algorithms are very simple and few control parameters are used to various optimization problems. However, they are less efficient than the population searching because their convergence is too slow. The other class is the evolutionary algorithm [31], [32], [33], [34], [35], such as genetic algorithm (GA) [32], [33], ant-colony method [34], and particle swarm optimization [35]. These algorithms are widely applied in study of various clusters, and have achieved remarkable successes in structural optimization of clusters. Nevertheless, among these algorithms, it is difficult to select the optimal solutions from many control parameters, and it needs about tens of thousands of local optimization steps for large clusters. Therefore, it is not effective and very time-consuming for the large clusters. Furthermore, a parallel method has been recently introduced into the evolutionary algorithm during the structural optimization of clusters [36], [37]. Although the parallel scheme keeps the diversity of the solutions and enhances the global searching capability to some extent, it makes the main features of previous implementation lose since it only reserves an optimal solution.
To search the globally steady structure of the clusters more efficiently, in this article we propose a multi-populations multi-strategies differential evolution (DE) algorithm to perform the structural optimization of Fe (Cr) clusters. First, to reduce the calculation time and improve the searching efficiency, a local optimization strategy is introduced by transferring the potential energy surface into a set of basins of attraction. Secondly, the multi-populations with an elite pool method is applied to keep the diversity of the solutions and avoid prematurely trapping into local optima. Meanwhile, to improve the convergence speed and lower the computational demand, the multi-strategies such as growing method in initialization and three differential strategies in mutation are introduced into DE algorithm. Importantly, an adjusting strategy is applied to modify the broken structures caused by crossover operator. Additionally, the Finnis–Sinclair potentials are adopted to describe the interatomic interactions between iron (chromium) atoms in the global optimization. Furthermore, to test and verify the accuracy of the proposed algorithm, some benchmark data published by Cambridge Cluster Database (CCD) have been used for comparison with the results of global optimization for Fe clusters. The lowest-energy structures of Cr clusters have also been predicted by the multi-populations multi-strategies DE algorithm. This article is structured as follows. Section 2 describes the Finnis–Sinclair potentials for Fe and Cr clusters and introduces the DE algorithm with multi-population evolution. Section 3 presents the calculated results and discussion. The main conclusions are summarized in Section 4.
Section snippets
Potential description
In atomistic simulations, it is considerably important to precisely describe the interatomic forces and interaction energy. As extensively employed potentials, the Finnis–Sinclair (F–S) potentials have been constructed explicitly in the spirit of the second-moment approximation to the tight-binding model [38]. In the F–S potentials, the total potential energy for a system of atoms is given as follows [10] where represents the separation between the th
Results and discussion
In this section, a set of computer simulations are performed to analyze the efficiency of the multi-populations multi-strategies DE algorithm by testing the results of Fe clusters. Moreover, the stable structures of Cr clusters are predicted by using the multi-populations multi-strategies DE algorithm. We have used the C language to perform the simulations, and the computer hardware environment is Intel quad-core E5606 processor (CPU), the software environments are Windows XP and Visual C++ 6.0.
Conclusions
In this article, a multi-populations multi-strategies differential evolution algorithm has been proposed to optimize the structures of Fe and Cr clusters. A local optimization strategy has been introduced by transferring the potential energy surface into a set of basins of attraction. Importantly, the multi-populations with an elite pool method have been applied to keep the diversity of the solutions and avoid prematurely trapping into local optima. To improve the convergence speed and lower
Acknowledgments
This work is supported by the National Natural Science Foundation of China (Grant Nos. 11474234, 51271156 and 61304141), the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20130121110012), and the Natural Science Foundation of Fujian Province of China (Grant Nos. 2013J01255, 2013J06002 and 2014J01252).
References (44)
- et al.
Surf. Sci. Rep.
(2005) - et al.
J. Catal.
(2004) - et al.
Chem. Phys. Lett.
(1996) - et al.
Chem. Phys. Lett.
(2002) - et al.
Science
(2004) - et al.
Comput. Mater. Sci.
(2006) - et al.
Solid State Commun.
(2007) - et al.
Appl. Catal. A
(2001) - et al.
Carbon
(2009) - et al.
Acta Mater.
(2012)
J. Phys. Chem. Solids
Chem. Phys. Lett.
Chem. Phys. Lett.
Proc. Natl. Acad. Sci. USA
Science
Phil. Mag.
J. Chem. Phys.
Phil. Mag.
Phys. Rev. B
Phys. Rev. B
J. Phys. Chem. C
J. Phys. Chem. A
Cited by (20)
B-ITO: A MATLAB toolbox for isogeometric topology optimization with Bézier extraction of NURBS
2024, Advances in Engineering SoftwareExploring the influence of initial design domain dependencies in concurrent multiscale topology optimization for heat conductivity maximization
2024, Computer Physics CommunicationsDifferential Evolution: A review of more than two decades of research
2020, Engineering Applications of Artificial IntelligenceCitation Excerpt :Do et al. (2016) proposed a novel DE approach in which scaling factor F and crossover rate Cr are made adaptive, also the mutation and selection phases of the original DE are substituted by the best individual-based mutation and elitist selection techniques. Fan et al. (2016) proposed a multi-population multi-strategies differential evolution algorithm that was applied for searching the globally stable structure of Fe and Cr nano-clusters. Li et al. (2016) combined two DE strategies and developed a new hybridized DE algorithm.
Multi-population techniques in nature inspired optimization algorithms: A comprehensive survey
2019, Swarm and Evolutionary ComputationCitation Excerpt :Podgorelec et al. [226] studied evolving balanced decision trees using a multi-population GA, and the simulation results showed that the proposed method outperformed the other methods. On the other hand, a multi-population multi-strategy DE algorithm for structural optimization of metal nanoclusters was presented in Ref. [227], where the product design and downstream life cycle descriptions were modeled by a multi-level graph data structure. Industrial case studies had been implemented to show the effectiveness of the proposed algorithm.
Improved genetic algorithm for optimization design of a three-dimensional braided composite joint
2018, Composite StructuresCitation Excerpt :But these methods might be trapped into local optimal solutions. The other class is gradient-independent heuristic methods, such as Simulated Annealing Algorithm [7], Particle Swarm Optimization (PSO) [8,9], Firefly Algorithm (FA) [10,11], Genetic Algorithm (GA) [12–14], Ant Colony Optimization [15], and Differential Evolution Algorithm (DE) [16,17]. These methods have better global searching performance and can be applied to problems containing discrete variables.