Structural optimization of Pt–Pd alloy nanoparticles using an improved discrete particle swarm optimization algorithm

https://doi.org/10.1016/j.cpc.2014.09.007Get rights and content

Abstract

Pt–Pd alloy nanoparticles, as potential catalyst candidates for new-energy resources such as fuel cells and lithium ion batteries owing to their excellent reactivity and selectivity, have aroused growing attention in the past years. Since structure determines physical and chemical properties of nanoparticles, the development of a reliable method for searching the stable structures of Pt–Pd alloy nanoparticles has become of increasing importance to exploring the origination of their properties. In this article, we have employed the particle swarm optimization algorithm to investigate the stable structures of alloy nanoparticles with fixed shape and atomic proportion. An improved discrete particle swarm optimization algorithm has been proposed and the corresponding scheme has been presented. Subsequently, the swap operator and swap sequence have been applied to reduce the probability of premature convergence to the local optima. Furthermore, the parameters of the exchange probability and the ‘particle’ size have also been considered in this article. Finally, tetrahexahedral Pt–Pd alloy nanoparticles has been used to test the effectiveness of the proposed method. The calculated results verify that the improved particle swarm optimization algorithm has superior convergence and stability compared with the traditional one.

Introduction

Clusters or nanoparticles (NPs), which are aggregates of atoms or molecules ranging from a few to millions, constitute a new type of material different from the individual atoms or molecules or bulk counterpart  [1], [2]. Metal NPs have aroused intense interests due to their potential applications in biomedicine, electronics, optical and catalysis fields  [3]. Among these NPs, Pt NP is considered as one of the best catalysts because of its excellent reactivity and stability  [4]. However, the extremely high price of Pt makes it expensive to use Pt metal. Generally, there are two types of NPs to reduce the demand for Pt: One is Pt NPs with open surface structures, and the other is Pt-based alloy NPs  [5]. A representative of the former is tetrahexahedral (THH) Pt NPs with high-index facets which have been synthesized by an electrochemical route and exhibited greatly enhanced catalytic activity compared with the existing commercial Pt/C catalysts  [6], [7]. For the latter, Pt–Pd alloy NPs have been extensively investigated due to their acceptable price and enhanced catalytic activity and selectivity  [8]. To further improve the chemical activity of Pt–Pd alloy NPs, a feasible strategy is to prepare high-index-faceted Pt–Pd alloy NPs. A typical example is that the synthesized THH Pt–Pd alloy NPs, which mainly enclosed by {10  3  0} high-index facets, exhibit a catalytic activity at least three times higher than the THH Pd NPs, and six times higher than commercial Pd black catalysts for the electrooxidation of formic acid due to the synergy effects of high-index facets and electronic structures of the alloy  [9].

Since the activity and selectivity of NP catalysts are closely associated with their structures, investigation of the stable structures is crucial for understanding their catalytic performances. The nature of searching the stable structures of NPs is a typical optimization problem. Usually, the potential energy is used as a standard in finding the most stable structure of NP corresponding to the lowest-energy structure at the ground state. However, the number of local minimum rises exponentially with the increasing particle sizes in the global optimization scheme, and thus the searching procedures are computationally expensive. For example, the number of local minimum is 1505 for the Lennard-Jones clusters with 13 atoms, but the number of local minimum is at least 1012 for a larger cluster with 55 atoms  [10]. Essentially, the global optimization for searching the stable structures of NPs is a nonpolynomial-complete problem  [11]. To date, some methods have been proposed to solve this problem. They can be classified into four categories: Genetic Algorithm (GA)  [12], [13], [14], [15], [16], [17], [18], Particle Swarm Optimization (PSO) algorithm  [19], [20], [21], [22], Monte Carlo method  [4], [23], [24], [25], [26], [27] and the remaining methods such as conjugate gradients method  [28], [29], [30], [31]. However, developing a new method becomes an urgent need for the global optimization of NPs due to the following two aspects. On one hand, most of available studies focus on stable structures of small clusters while large alloy NPs have rarely been studied. On the other hand, the methods used in the structural optimization of these clusters or NPs concentrate mainly on the genetic algorithm and Monte Carlo methods. The genetic algorithm is costly and very time-consuming for the large NPs, and the convergence of the Monte Carlo methods is too slow  [2], [10]. The pioneering works of Wang et al.  [19], [20], [21] and Lv et al.  [22] have shown that the PSO is a highly efficient method for the prediction of global stable structure. However, their works mainly addressed the studies of small clusters, and it may be too time-consuming to realize the structure optimization if their computational approaches are used directly for large NPs. Therefore, development of a feasible and effective method is of great importance for the theoretical study of large NPs.

As we know, the particle swarm optimization (PSO) algorithms have been extensively used to solve the combinatorial optimization problems such as traveling salesman problem (TSP)  [32], [33], [34], [35], and the corresponding results have definitely verified their effectiveness. Actually, searching the stable structures of NPs is also a typical combinatorial optimization problem. Inspired by the applications of the PSO algorithms in the TSP, in this article we have proposed an improved PSO algorithm to carry out the structural optimization of Pt–Pd alloy NPs. The THH Pt–Pd alloy NPs, bound with high-index facets, have been chosen to be investigated because of their significance in catalysis fields. The design scheme will be systematically introduced in the following section. Furthermore, the parameters setting rules will be verified in the fourth section, and the analyses of convergence and stability will be thoroughly investigated by comparison with the traditional PSO algorithm. To the best of our knowledge, this is the first report on the PSO algorithm being used in large alloy NPs. This article is organized as follows. In Section  2, we firstly describe how to obtain the stable structures of Pt–Pd alloy NPs, and then their optimization models are presented. Section  3 introduces the coding scheme, swap operator and swap sequence to adapt to the discretization of structural optimization. The calculated results and the related discussion are presented in Section  4, and the main conclusions are summarized in Section  5. To avoid the misapprehension or confusion, we introduce the ‘particle’ to denote the particle used in the PSO method and the particle without single quotation marks to denote the nanoparticle or cluster.

Section snippets

Problem definition

In this section, we will describe how to obtain the most stable structure of THH Pt–Pd alloy NPs. First, a Pt face-centered cube (fcc) single crystal is generated. Subsequently, the THH Pt–Pd alloy NP models are cut from this crystal, in which Pt atoms are randomly replaced by Pd ones through computer-produced random seeds. The initial configurations of the THH Pt–Pd alloy NPs are finally gained. Note that the atomic radii of Pt and Pd are rather close (1.39 Å for Pt and 1.38 Å for Pd)  [36],

Coding scheme

Essentially, the structural optimization of Pt–Pd alloy NPs is a discrete and combinatorial optimization problem. Here we employ the PSO algorithm to solve the combinatorial optimization, as described in Section  2.2. Firstly, the binary coding method is applied to code the position of atom into a sequence of zero and one. Subsequently, all the coordinates of atoms in the NP are numbered from 1 to N. Let the proportion of Pt and Pd atoms be w, the coding scheme is defined as follows:

Sequence011

Results and discussion

In this section, a set of computer simulations is performed to analyze the efficiency of the improved PSO algorithm and the corresponding results about the stable structures of the Pt–Pd alloy NPs. We have used the Java language to perform the simulations, and the computer hardware environment is Intel quad-core E5606 processor (CPU), the software environment are Windows XP and Eclipse.

Conclusions

In this article, we have proposed an improved PSO algorithm to perform the structural optimization of THH Pt–Pd alloy NPs. The design scheme of the improved algorithm has been presented in detail. In the improved PSO algorithm, the swap operator and swap sequence have been first used to solve the discrete problem in searching the stable structure of the alloy NPs. Furthermore, inspired by the mutation operator in the genetic algorithms, we have introduced the exchange operation to avoid

Acknowledgments

This work is supported by the National Natural Science Foundation of China (Grant No. 51271156), the Natural Science Foundation of Fujian Province of China (Grant Nos. 2013J01255, 2013J06002).

References (38)

  • J.S. Oh et al.

    J. Phys.: Conf. Ser.

    (2013)
  • Y. Wang et al.

    Comput. Phys. Commun.

    (2012)
  • K. Yun et al.

    Acta Mater.

    (2012)
  • J.Y. Guo et al.

    J.~Phys.~Chem.~Solids

    (2012)
  • X.H. Shi et al.

    Inform. Process. Lett.

    (2007)
  • H. Haberland

    Clusters of Atoms and Molecules

    (1994)
  • R. Ferrando et al.

    Chem. Rev.

    (2008)
  • A.T. Bell

    Science

    (2003)
  • R. Huang et al.

    J. Phys. Chem. C

    (2012)
  • R. Huang et al.

    J. Phys. Chem. C

    (2013)
  • N. Tian et al.

    Science

    (2007)
  • N. Tian et al.

    J. Phys. Chem. C

    (2008)
  • F. Tao et al.

    Science

    (2008)
  • Y.J. Deng et al.

    Chem. Sci.

    (2012)
  • F. Baletto et al.

    Rev. Mod. Phys.

    (2005)
  • L.T. Wille et al.

    J. Phys. A

    (1985)
  • R. Pacheco-Contreras et al.

    RSC Adv.

    (2013)
  • J.S. Oh et al.

    Met. Mater. Int.

    (2013)
  • G. Rossi et al.

    J. Phys.: Condens. Matter.

    (2009)
  • Cited by (16)

    • Metaheuristic-based inverse design of materials – A survey

      2020, Journal of Materiomics
      Citation Excerpt :

      PtPd alloy nanoparticles are potential catalyst candidates for new-energy resources such as fuel cells and lithium ion batteries owing to their excellent reactivity and selectivity. To facilitate fast search for large and stable tetra hexahedral (THH) PtPd NPs, Shao et al. [87] developed a discrete PSO (DPSO). The quantum corrected Sutton-Chen many-body potentials was employed to describe the interatomic interactions between Pd and Pt.

    • Structural optimization and melting behavior investigation of Pd-Ag bimetallic nanoparticles by molecular simulations

      2020, Computational Materials Science
      Citation Excerpt :

      Essentially, it is a global optimization problem. Although there is no available algorithm which can solve such problems theoretically, some effective algorithms have been developed for practical applications in the past years, such as Monte Carlo, simulated annealing, particle swarm optimization and genetic algorithm [13–17]. In present work, genetic algorithm (GA) is employed to optimize atomic arrangement of specified Pd-Ag NP.

    • GPU-based DPSO algorithm for structural optimization of Pt-Co bimetallic nanoparticles

      2019, Physics Letters, Section A: General, Atomic and Solid State Physics
      Citation Excerpt :

      The main conclusions are summarized in Section 4. In our previous works, an improved PSO algorithm had been proposed to optimize the stable structures of Pt-Pd and Au-Pd alloy NPs [21,22]. Considering that the basic PSO algorithm cannot deal with such discrete problem like the structural optimization of alloy NPs, we made three improvements in the proposed method.

    • An improved genetic algorithm for structural optimization of Au–Ag bimetallic nanoparticles

      2018, Applied Soft Computing Journal
      Citation Excerpt :

      The probability of crossover is set to 0.8, and the probability of mutation is 0.0015. To test the effectiveness of IGA, the MCS and the PSO [12] algorithms are chosen for comparison. Here, the PSO is also started with the layered coordinate ranking method, the same with the IGA.

    View all citing articles on Scopus
    View full text