scholarly journals The Artificial Bee Colony Algorithm for Global Optimization of Nanosized Clusters

2019 ◽  
Author(s):  
Jun Zhang ◽  
Vassiliki-Alexandra Glezakou
Keyword(s):  
Global Optimization ◽  
Artificial Bee Colony ◽  
Fundamental Problem ◽  
Complex Structures ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Energy Chemistry ◽  
Nature Gas ◽  
Chemical Fields ◽  
Better Than

Global optimization of nanosized clusters is an important and fundamental problem in theoretical studies in many chemical fields, like catalysis, material, or energy chemistry, etc. In this paper, the powerful artificial bee colony (ABC) algorithm, which has been applied successfully in the global optimization of atomic and molecular clusters, has been developed for nanosized clusters of complex structures. The new ABC algorithm is applied to the global optimization of 4 systems of different chemical nature: gas phase Au55, ligated Au82+, graphene oxide and defected rutile-supported Au8, and cluster assemble [Co6Te8(PEt3)6][C60]𝑛. These clusters have sizes that lie between 1 to 3 nm and contain up to 1000 atoms, raising great challenges to the algorithm. Reliable global minima (GMs) are obtained for all cases, some of which are better than those reported in literature, indicating the excellent perfor-mance of the new ABC algorithm. These GMs provide chemically important insights into the systems. The new ABC algorithm has been coded into the latest version of ABCluster, making it a convenient and powerful tool for chemists from broad fields to rapidly carry out global optimizations of nanosized clusters.

scholarly journals NWPEsSe: an Adaptive-Learning Global Optimization Algorithm for Nanosized Cluster Systems

2020 ◽  
Author(s):  
Jun Zhang ◽  
Vassiliki-Alexandra Glezakou ◽  
Roger Rousseau ◽  
Manh-Thuong Nguyen
Keyword(s):  
Global Optimization ◽  
Gas Phase ◽  
Adaptive Learning ◽  
Fundamental Problem ◽  
Published Data ◽  
Cluster Assembly ◽  
Cluster Systems ◽  
Bee Colony ◽  
Nature Gas ◽  
Chemical Fields

Global optimization constitutes an important and fundamental problem in theoretical studies in many chemical fields, such as catalysis, materials or separations problems. In this paper, a novel algorithm has been developed for the global optimization of large systems including neat and ligated clusters in gas phase, and supported clusters in periodic boundary conditions. The method is based on an updated artificial bee colony (ABC) algorithm method, that allows for adaptive-learning during the search process. The new algorithm is tested against four classes of systems of diverse chemical nature: gas phase Au<sub>55</sub>, ligated Au<sub>8</sub><sup>2+</sup>, Au<sub>8</sub> supported on graphene oxide and defected rutile, and a large cluster assembly [Co<sub>6</sub>Te<sub>8</sub>(PEt<sub>3</sub>)<sub>6</sub>][C<sub>60</sub>]<sub>𝑛</sub>, with sizes ranging between 1 to 3 nm and containing up to 1300 atoms. Reliable global minima (GMs) are obtained for all cases, either confirming published data or reporting new lower energy structures. The algorithm and interface to other codes in the form of an independent program, Northwest Potential Energy Search Engine (NWPEsSe), is freely available and it provides a powerful and efficient approach for global optimization of nanosized cluster systems.

scholarly journals NWPEsSe: an Adaptive-Learning Global Optimization Algorithm for Nanosized Cluster Systems

2020 ◽  
Author(s):  
Jun Zhang ◽  
Vassiliki-Alexandra Glezakou ◽  
Roger Rousseau ◽  
Manh-Thuong Nguyen
Keyword(s):  
Global Optimization ◽  
Gas Phase ◽  
Adaptive Learning ◽  
Fundamental Problem ◽  
Published Data ◽  
Cluster Assembly ◽  
Cluster Systems ◽  
Bee Colony ◽  
Nature Gas ◽  
Chemical Fields

Global optimization constitutes an important and fundamental problem in theoretical studies in many chemical fields, such as catalysis, materials or separations problems. In this paper, a novel algorithm has been developed for the global optimization of large systems including neat and ligated clusters in gas phase, and supported clusters in periodic boundary conditions. The method is based on an updated artificial bee colony (ABC) algorithm method, that allows for adaptive-learning during the search process. The new algorithm is tested against four classes of systems of diverse chemical nature: gas phase Au<sub>55</sub>, ligated Au<sub>8</sub><sup>2+</sup>, Au<sub>8</sub> supported on graphene oxide and defected rutile, and a large cluster assembly [Co<sub>6</sub>Te<sub>8</sub>(PEt<sub>3</sub>)<sub>6</sub>][C<sub>60</sub>]<sub>𝑛</sub>, with sizes ranging between 1 to 3 nm and containing up to 1300 atoms. Reliable global minima (GMs) are obtained for all cases, either confirming published data or reporting new lower energy structures. The algorithm and interface to other codes in the form of an independent program, Northwest Potential Energy Search Engine (NWPEsSe), is freely available and it provides a powerful and efficient approach for global optimization of nanosized cluster systems.

scholarly journals MODIFIKASI BARU ALGORITMA KOLONI LEBAH BUATAN UNTUK MASALAH OPTIMASI GLOBAL

2018 ◽  
Vol 10 (1) ◽  
pp. 17
Author(s):  
Nursyiva Irsalinda ◽  
Sugiyarto Surono
Keyword(s):  
Food Source ◽  
Artificial Bee Colony ◽  
Selection Process ◽  
Optimization Technique ◽  
Food Sources ◽  
Abc Algorithm ◽  
Average Value ◽  
Bee Colony ◽  
Objective Function Values ◽  
Better Than

Artificial Bee Colony (ABC) algorithm is one of metaheuristic optimization technique based on population. This algorithm mimicking honey bee swarm to find the best food source. ABC algorithm consist of four phases: initialization phase, employed bee phase, onlooker bee phase and scout bee phase. This study modify the onlooker bee phase in selection process to find the neighborhood food source. Not all food sources obtained are randomly sought the neighborhood as in ABC algorithm. Food sources are selected by comparing their objective function values. The food sources that have value lower than average value in that iteration will be chosen by onlooker bee to get the better food source. In this study the modification of this algorithm is called New Modification of Artificial Bee Colony Algorithm (MB-ABC). MB-ABC was applied to 4 Benchmark functions. The results show that MB-ABC algorithm better than ABC algorithm

scholarly journals A Novel Optimization Algorithm Combing Gbest-Guided Artificial Bee Colony Algorithm with Variable Gradients

2020 ◽  
Vol 10 (10) ◽  
pp. 3352
Author(s):  
Xiaodong Ruan ◽  
Jiaming Wang ◽  
Xu Zhang ◽  
Weiting Liu ◽  
Xin Fu
Keyword(s):  
Global Optimization ◽  
Optimization Algorithm ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Numerical Test ◽  
Stochastic Algorithm ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Novel Algorithm

The artificial bee colony (ABC) algorithm, which has been widely studied for years, is a stochastic algorithm for solving global optimization problems. Taking advantage of the information of a global best solution, the Gbest-guided artificial bee colony (GABC) algorithm goes further by modifying the solution search equation. However, the coefficient in its equation is based only on a numerical test and is not suitable for all problems. Therefore, we propose a novel algorithm named the Gbest-guided ABC algorithm with gradient information (GABCG) to make up for its weakness. Without coefficient factors, a new solution search equation based on variable gradients is established. Besides, the gradients are also applied to differentiate the priority of different variables and enhance the judgment of abandoned solutions. Extensive experiments are conducted on a set of benchmark functions with the GABCG algorithm. The results demonstrate that the GABCG algorithm is more effective than the traditional ABC algorithm and the GABC algorithm, especially in the latter stages of the evolution.

Differential Operators Embedded Artificial Bee Colony Algorithm

2013 ◽  
pp. 149-163
Author(s):  
Tarun Kumar Sharma ◽  
Millie Pant
Keyword(s):  
Global Optimization ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Differential Operators ◽  
Optimization Problems ◽  
Numerical Results ◽  
Benchmark Problems ◽  
Continuous Space ◽  
Abc Algorithm ◽  
Bee Colony

Artificial Bee Colony (ABC) is one of the most recent nature inspired (NIA) algorithms based on swarming metaphor. Proposed by Karaboga in 2005, ABC has proven to be a robust and efficient algorithm for solving global optimization problems over continuous space. However, it has been observed that the structure of ABC is such that it supports exploration more in comparison to exploitation. In order to maintain a balance between these two antagonist factors, this paper suggests incorporation of differential evolution (DE) operators in the structure of basic ABC algorithm. The proposed algorithm called DE-ABC is validated on a set of 10 benchmark problems and the numerical results are compared with basic DE and basic ABC algorithm. The numerical results indicate that the presence of DE operators help in a significant improvement in the performance of ABC algorithm.

Differential Operators Embedded Artificial Bee Colony Algorithm

2011 ◽  
Vol 2 (3) ◽  
pp. 1-14 ◽  
Author(s):  
Tarun Kumar Sharma ◽  
Millie Pant
Keyword(s):  
Global Optimization ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Differential Operators ◽  
Optimization Problems ◽  
Numerical Results ◽  
Benchmark Problems ◽  
Continuous Space ◽  
Abc Algorithm ◽  
Bee Colony

Artificial Bee Colony (ABC) is one of the most recent nature inspired (NIA) algorithms based on swarming metaphor. Proposed by Karaboga in 2005, ABC has proven to be a robust and efficient algorithm for solving global optimization problems over continuous space. However, it has been observed that the structure of ABC is such that it supports exploration more in comparison to exploitation. In order to maintain a balance between these two antagonist factors, this paper suggests incorporation of differential evolution (DE) operators in the structure of basic ABC algorithm. The proposed algorithm called DE-ABC is validated on a set of 10 benchmark problems and the numerical results are compared with basic DE and basic ABC algorithm. The numerical results indicate that the presence of DE operators help in a significant improvement in the performance of ABC algorithm.

A quasi-affine transformation artificial bee colony algorithm for global optimization

2021 ◽  
pp. 1-18
Author(s):  
Baohua Zhao ◽  
Tien-Wen Sung ◽  
Xin Zhang
Keyword(s):  
Affine Transformation ◽  
Artificial Bee Colony ◽  
Triangular Matrix ◽  
Convergence Speed ◽  
Test Set ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Search Mechanism ◽  
Multiple Dimensions ◽  
Collaborative Search

The artificial bee colony (ABC) algorithm is one of the classical bioinspired swarm-based intelligence algorithms that has strong search ability, because of its special search mechanism, but its development ability is slightly insufficient and its convergence speed is slow. In view of its weak development ability and slow convergence speed, this paper proposes the QABC algorithm in which a new search equation is based on the idea of quasi-affine transformation, which greatly improves the cooperative ability between particles and enhances its exploitability. During the process of location updating, the convergence speed is accelerated by updating multiple dimensions instead of one dimension. Finally, in the overall search framework, a collaborative search matrix is introduced to update the position of particles. The collaborative search matrix is transformed from the lower triangular matrix, which not only ensures the randomness of the search, but also ensures its balance and integrity. To evaluate the performance of the QABC algorithm, CEC2013 test set and CEC2014 test set are used in the experiment. After comparing with the conventional ABC algorithm and some famous ABC variants, QABC algorithm is proved to be superior in efficiency, development ability, and robustness.

scholarly journals A Shuffle-Based Artificial Bee Colony Algorithm for Solving Integer Programming and Minimax Problems

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1211
Author(s):  
Ivona Brajević
Keyword(s):  
Integer Programming ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Minimax Problems ◽  
Abc Algorithm ◽  
Bee Colony ◽  
Effective Performance ◽  
Complex Optimization ◽  
Overall Performance ◽  
Integer Programming Problems

The artificial bee colony (ABC) algorithm is a prominent swarm intelligence technique due to its simple structure and effective performance. However, the ABC algorithm has a slow convergence rate when it is used to solve complex optimization problems since its solution search equation is more of an exploration than exploitation operator. This paper presents an improved ABC algorithm for solving integer programming and minimax problems. The proposed approach employs a modified ABC search operator, which exploits the useful information of the current best solution in the onlooker phase with the intention of improving its exploitation tendency. Furthermore, the shuffle mutation operator is applied to the created solutions in both bee phases to help the search achieve a better balance between the global exploration and local exploitation abilities and to provide a valuable convergence speed. The experimental results, obtained by testing on seven integer programming problems and ten minimax problems, show that the overall performance of the proposed approach is superior to the ABC. Additionally, it obtains competitive results compared with other state-of-the-art algorithms.

Sign in / Sign up

Export Citation Format

Share Document