Open AccessHeuristic compactness maximization algorithm for two-dimensional single-atom traps rearrangement
Author(s) -
Tanakrit Mamee,
Warat Anukool,
Nithiwadee Thaicharoen,
N Chattrapiban,
Pimonpan Sompet
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2145/1/012024
Subject(s) - compact space , heuristic , maximization , algorithm , set (abstract data type) , layer (electronics) , position (finance) , atom (system on chip) , topology (electrical circuits) , mathematics , computer science , mathematical optimization , combinatorics , materials science , nanotechnology , mathematical analysis , parallel computing , finance , economics , programming language
We establish an algorithm and computational results based on heuristic rearrangement of randomly filled array toward a defect-free and compact array. In this approach, the vacancies are filled from the inner layer that is related to the distance from the center of each loading site. By rearranging the position of atoms that maximize the compactness of the system layer by layer, the algorithm is set to iterate until the compactness reaches its local maximum. The results show that by applying the algorithm, the compactness of the system converges up to ∼97% of the theoretical maximum.