Binary cluster structure optimizing method based on simulated annealing optimization algorithm
An optimization algorithm and simulated annealing technology, applied in computing, computing models, biological models, etc., can solve problems such as low algorithm efficiency, difficulty in finding the optimal structure, and positional isomerism
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0025] This embodiment is a method based on the simulated annealing optimization algorithm for binary cluster structure optimization. For the workflow, refer to figure 1 shown.
[0026] Binary Lennard-Jones cluster A n B m (n+m<30) structural optimization as an example, the specific implementation steps are:
[0027] (1) Set the initial temperature T max = 3.0, design annealing schedule: T k =T max *exp[-1.5*(k / K) 0.25 ]; where k is the number of iterations, K=20.
[0028] (2) Generate an initial structure library. At a radius R=σ AB [(3*(n+m)) / (4π)] 1 / 3 (σ AB The coordinates of the initial structure are randomly generated in the sphere (n is the number of A-type atoms, m is the number of B-type atoms), and randomly select n A-types from these n+m coordinates atoms, the rest are B-type atoms. Randomly generate M initial structures. The energy value of each individual in the structure library is calculated according to the interaction between the atoms of the binar...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


