ISSN 0253-2778

CN 34-1054/N

open
Free to Publish. Free to Read.
Open AccessOpen Access JUSTC

Comparative study of basin-hopping and the minima-hopping global optimization methods: A case study on Lennard-Jones clusters

  • 1.

    Department of Electronic Information, Anhui Finance & Trade Vocational College, Hefei 230601, China

  • 2.

    Department of Chemistry, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599, USA

  • 3.

    Dalian Institute of Chemical Physics of Chinese Academy of Sciences, Dalian 116000, China

  • 4.

    Key Laboratory of Intelligent Computing & Signal Processing, Ministry of Education, Anhui University, Hefei 230039, China

Cite this: JUSTC, 2015, 45(5): 373-378
https://doi.org/10.3969/j.issn.0253-2778.2015.05.005
More Information
  • Received Date: March 23, 2015
  • Revised Date: May 11, 2015
  • Published Date: May 30, 2015
    Abstract
  • In order to find a better algorithm for global optimization of Lennard-Jones cluster, two algorithms, basin-hopping and minima-hopping, were used to optimize the structures of 13 particles, 38 particles, and 60 particles Lennard-Jones clusters. Both algorithms find global minima, while the minima-hopping method yields a faster search speed which is at least one order faster than the basin-hopping method.
    • FullText(HTML)
    References (0)
    Related Articles
    Track Citations

Catalog

    Get Citation
    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML

    Related Articles

    [1]Long Liu, Wenting Gao, Yiling Ma, Kainan Mei, Wenlong Wu, Hongliang Li, Zhirong Zhang, Jie Zeng. Synergistic effect of heterogeneous single atoms and clusters for improved catalytic performance[J]. JUSTC, 2024, 54(6): 0605. DOI: 10.52396/JUSTC-2024-0046
    [2]WANG Jiayu, ZHANG Zhenyu, CHU Zheng, WU Xiaohong. A trajectory data density partition based distributed parallel clustering method[J]. JUSTC, 2018, 48(1): 47-56. DOI: 10.3969/j.issn.0253-2778.2018.01.007
    [3]LI Dandan, JIANG Yong, YAO Tao, SUN Zhihu, WEI Shiqiang. Tuning the fluorescence property of copper nanoclusters[J]. JUSTC, 2015, 45(5): 359-365. DOI: 10.3969/j.issn.0253-2778.2015.05.003
    [4]ZOU Guoqi, XU Jing, ZHU Yuanping. Cooperative scheduling and power allocation scheme based on user clustering in LTE uplink[J]. JUSTC, 2015, 45(4): 294-301. DOI: 10.3969/j.issn.0253-2778.2015.04.006
    [5]LI Darui, YANG Linjun, HUA Xiansheng, ZHANG Hongjiang. A robust approximate algorithm for large-scale clustering of visual features[J]. JUSTC, 2014, 44(10): 844-852. DOI: 10.3969/j.issn.0253-2778.2014.10.008
    [6]PAN Yang, CHENG Xijun. The optimal portfolio with modified covariance matrix using clustering method[J]. JUSTC, 2014, 44(3): 244-247. DOI: 10.3969/j.issn.0253-2778.2014.03.014
    [7]FENG Yuan, XU Hongguang, HOU Gaolei, KONG Xiangyu. Experimental and theoretical investigation of the superhalogen character of BO2 cluster[J]. JUSTC, 2013, 43(5): 369-378. DOI: 10.3969/j.issn.0253-2778.2013.05.004
    [8]LIU Wenchao, YAO Jun, LI Aifen, SUN Zhixue, HUANG Zhaoqin. Nonlinear flow characteristics in low-permeability reservoirs with stress sensitive effect[J]. JUSTC, 2012, 42(4): 279-288. DOI: 10.3969/j.issn.0253-2778.2012.04.004
    [9]XU Li, JIANG Jiaming. Reliable multicast protocol based on reputation mechanism in wireless multi-hop networks[J]. JUSTC, 2011, 41(10): 928-934. DOI: 10.3969/j.issn.0253-2778.2011.10.014
    [10]HUANG Gao-yong, FANG Xu-ming, CAO Jian-nong. An energy-saving scheduling scheme for two-hop relay networks[J]. JUSTC, 2009, 39(10): 1076.
    TrendMD
    Volume 45 Issue 5 PP. 373-378
    Cover

    Article Metrics

    Article views (420) PDF downloads (271)

    Copyright © Editorial Office of JUSTC, All Rights Reserved. 皖ICP备05002528号

    Supported by: Beijing Renhe Information Technology Co., Ltd.  Baidu Analytics

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return