Jun Zhang

Jun Zhang

Auto-generated profile, based on publicly available information

Jun Zhang

Institute of Systems and Physical Biology, Shenzhen Bay Laboratory, Shenzhen 518055, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 August 2021 in Physical Chemistry Chemical Physics
Verified
Journal Article
Closed access
PDF file
JZJun Zhang
Jun Zhang
TLTian Lu
Tian Lu
The computerized optimized code enables Multiwfn to carry out large scale electronstatic potential analyses for systems of considerable size.

19 August 2015 in Physical Chemistry Chemical Physics
Verified
Journal Article
Closed access
PDF file
JZJun Zhang
Jun Zhang
MDMichael Dolg
Michael Dolg
Global optimization of cluster geometries is of fundamental importance in chemistry and an interesting problem in applied mathematics. In this work, we introduce a relatively new swarm intelligence algorithm, i.e. the artificial bee colony (ABC) algorithm proposed in 2005, to this field. It is inspired by the foraging behavior of a bee colony, and only three parameters are needed to control it. We applied it to several potential functions of quite different nature, i.e., the Coulomb–Born–Mayer, Lennard-Jones, Morse, Z and Gupta potentials. The benchmarks reveal that for long-ranged potentials the ABC algorithm is very efficient in locating the global minimum, while for short-ranged ones it is sometimes trapped into a local minimum funnel on a potential energy surface of large clusters. We have released an efficient, user-friendly, and free program “ABCluster” to realize the ABC algorithm. It is a black-box program for non-experts as well as experts and might become a useful tool for chemists to study clusters.

16 December 2015 in Physical Chemistry Chemical Physics
Verified
Journal Article
Closed access
PDF file
JZJun Zhang
Jun Zhang
MDMichael Dolg
Michael Dolg
The global optimization of molecular clusters is an important topic encountered in many fields of chemistry. In our previous work (Phys. Chem. Chem. Phys., 2015, 17, 24173), we successfully applied the recently introduced artificial bee colony (ABC) algorithm to the global optimization of atomic clusters and introduced the corresponding software “ABCluster”. In the present work, ABCluster was extended to the optimization of clusters of rigid molecules. Here “rigid” means that all internal degrees of freedom of the constituent molecules are frozen. The algorithm was benchmarked by TIP4P water clusters (H2O)N (N ≤ 20), for which all global minima were successfully located. It was further applied to various clusters of different chemical nature: 10 microhydration clusters, 4 methanol microsolvation clusters, 4 nonpolar clusters and 2 ion–aromatic clusters. In all the cases we obtained results consistent with previous experimental or theoretical studies.

14 December 2017 in Journal of Chemical Theory and Computation
Verified
Journal Article
Closed access
JZJun Zhang
Jun Zhang

21 November 2020 in International Journal of Quantum Chemistry
Verified
Journal Article
Open access
PDF file
JZJun Zhang
Jun Zhang
VGVassiliki‐Alexandra Glezakou
Vassiliki‐Alexandra Glezakou
Chemical clusters are relevant to many applications in catalysis, separations, materials, and energy sciences. Experimentally, the structure of clusters is difficult to determine, but it is very important in understanding their chemistry and properties. Computational methods can be used to examine cluster structure, however finding the most stable structure is not simple, particularly as the cluster size increases. Global optimization techniques have long been used to tackle the problem of the most stable structure, but such approaches would have to look for a global minimum, while sampling local minima over the whole potential energy surface as well. In this review, the state‐of‐the‐art theory of global optimization theory is summarized. First, the definition, significance, relation to experiments, and a brief history of global optimization is presented. We then discuss, in more detail, three versatile global optimization methods: the basin hopping, the artificial bee colony algorithm, and the genetic algorithm. We close with some representative application examples of global optimization of clusters since 2016 and the challenges, open questions and opportunities in this field.

4 May 2020 in Journal of Chemical Theory and Computation
Verified
Journal Article
Closed access
JZJun Zhang
Jun Zhang
Vassiliki-Alexandra GlezakouVassiliki-Alexandra Glezakou
Vassiliki-Alexandra Glezakou
RRRoger Rousseau
Roger Rousseau
MNManh-Thuong Nguyen
Manh-Thuong Nguyen