The improved intelligent bionic optimization algorithm based on the growth characteristics of tree branches

2021 ◽  
pp. 1-9
Author(s):  
Fei Tang
Keyword(s):  
Genetic Algorithm ◽  
Tree Growth ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Optimal Solution ◽  
Growth Characteristics ◽  
Ant Colony ◽  
Optimization Function ◽  
Growth Space ◽  
The Individual

To improve the optimization efficiency of the intelligent bionic optimization algorithm, this paper proposes intelligent bionic optimization algorithm based on the growth characteristics of tree branches. Firstly, the growth organ of the tree is mapped into the coding of the tree growth algorithm (intelligent bionic optimization algorithm). Secondly, the entire tree, that is the growing tree, is formed by selecting the individual that grows fast to generate the next level of shoot population. Lastly, if the growing tree reaches a certain level, the individual coding of the shoots is added to enhance the searching ability of the individuals of current generation in the growth tree growth space, so that the algorithm approaches the optimal solution. The experimental results were compared with the optimization results of the genetic algorithm and the ant colony algorithm using the classic optimization function and showed that this algorithm has fewer iterations, a faster convergence speed, higher precision, and a better optimization ability than the genetic algorithm and the ant colony algorithm.

scholarly journals Intelligent Bionic Optimization Algorithm Based on the Growth Characteristics of Tree Branches

2021 ◽  
Vol 15 (2) ◽  
pp. 34-46
Author(s):  
Fei Tang
Keyword(s):  
Genetic Algorithm ◽  
Tree Growth ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Morphological Characteristics ◽  
Optimal Solution ◽  
Shoot Tip ◽  
Experimental Results ◽  
Ant Colony ◽  
The Individual

To improve the performance of bionic algorithms, an intelligent bionic optimization algorithm is proposed based on the morphological characteristics of trees growing toward light. The growth organ of the tree is mapped into the coding of the tree growth algorithm, and the entire tree is formed by selecting the fastest growing individual to form the next level of the tree. When the tree growth reaches a certain level, the individual code of the shoot tip is added to enhance the search ability of the individual shoot tip in the growth space of the entire tree. This method achieves a near-optimal solution. The experimental results were compared with the optimization results of the genetic algorithm and the ant colony algorithm using the classic optimization function. The experimental results show that this algorithm has fewer iterations, a faster convergence speed, higher precision, and a better optimization ability than the genetic algorithm or the ant colony algorithm.

scholarly journals Comparison Performance of Genetic Algorithm and Ant Colony Optimization in Course Scheduling Optimizing

2016 ◽  
Vol 3 (2) ◽  
pp. 149-158 ◽  
Author(s):  
Imam Ahmad Ashari ◽  
Much Aziz Muslim ◽  
Alamsyah Alamsyah
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Optimal Solution ◽  
Optimization Techniques ◽  
Ant Colony ◽  
Scheduling Problems ◽  
Ant Colony Optimization Algorithm ◽  
Course Scheduling ◽  
The University

Scheduling problems at the university is a complex type of scheduling problems. The scheduling process should be carried out at every turn of the semester's. The core of the problem of scheduling courses at the university is that the number of components that need to be considered in making the schedule, some of the components was made up of students, lecturers, time and a room with due regard to the limits and certain conditions so that no collision in the schedule such as mashed room, mashed lecturer and others. To resolve a scheduling problem most appropriate technique used is the technique of optimization. Optimization techniques can give the best results desired. Metaheuristic algorithm is an algorithm that has a lot of ways to solve the problems to the very limit the optimal solution. In this paper, we use a genetic algorithm and ant colony optimization algorithm is an algorithm metaheuristic to solve the problem of course scheduling. The two algorithm will be tested and compared to get performance is the best. The algorithm was tested using data schedule courses of the university in Semarang. From the experimental results we conclude that the genetic algorithm has better performance than the ant colony optimization algorithm in solving the case of course scheduling.

scholarly journals Optimization of one-dimensional wire cutting with variable length based on genetic ant colony algorithm

2021 ◽  
Vol 336 ◽  
pp. 02011
Author(s):  
Xin Xia ◽  
Defu Wan
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Algorithm ◽  
Raw Materials ◽  
Optimal Solution ◽  
Ant Colony ◽  
Utilization Rate ◽  
Fusion Algorithm ◽  
One Dimensional ◽  
Experimental Parameters ◽  
Wire Cutting

This paper presents an algorithm of one-dimensional wire cutting based on genetic algorithm and ant colony algorithm. Firstly, the dominant solution is screened out by genetic algorithm and transformed into the initial accumulation of pheromone in ant colony algorithm, and then the ant colony algorithm is used to adjust the dominant solution of genetic algorithm to obtain the approximate optimal solution. The experimental results show that the convergence rate of the fusion algorithm is faster than that of the ant colony algorithm, and the utilization rate of raw materials is higher than that of genetic algorithm. In addition, the optimal parameters are obtained by adjusting the experimental parameters of the fusion algorithm.

scholarly journals Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 Environment

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Weichuan Ni ◽  
Zhiming Xu ◽  
Jiajun Zou ◽  
Zhiping Wan ◽  
Xiaolei Zhao
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Network Performance ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Optimal Solution ◽  
Ant Colony ◽  
Routing Optimization ◽  
Ipv6 Network

The traditional IPv6 routing algorithm has problems such as network congestion, excessive energy consumption of nodes, and shortening the life cycle of the network. In response to this phenomenon, we proposed a routing optimization algorithm based on genetic ant colony in IPv6 environment. The algorithm analyzes and studies the genetic algorithm and the ant colony algorithm systematically. We use neural network to build the initial model and combine the constraints of QoS routing. We effectively integrate the genetic algorithm and ant colony algorithm that maximize their respective advantages and apply them to the IPv6 network. At the same time, in order to avoid the accumulation of a lot of pheromones by the ant colony algorithm in the later stage of the network, we have introduced an anticongestion reward and punishment mechanism. By comparing the search path with the optimal path, rewards and punishments are based on whether the network path is smooth or not. Finally, it is judged whether the result meets the condition, and the optimal solution obtained is passed to the BP neural network for training; otherwise, iterative iterations are required until the optimal solution is satisfied. The experimental results show that the algorithm can effectively adapt to the IPv6 routing requirements and can effectively solve the user’s needs for network service quality, network performance, and other aspects.

Intelligent Optimization Study of Traveling Salesman Problem

2013 ◽  
Vol 385-386 ◽  
pp. 1906-1908
Author(s):  
Ying Ying Wen
Keyword(s):  
Basic Principle ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Optimal Solution ◽  
Natural World ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Intelligent Optimization ◽  
Optimization Study

Ant colony optimization algorithm is a new simulated evolutionary algorithm by simulating the ant routing behavior of the natural world. In this paper, the basic principle of ant colony algorithm is applied to the classic TSP problem. Simulation examples show that the ant colony algorithm has better robustness and can quickly find the optimal solution.

An Improved Ant Colony Optimization Algorithm for Solving the TSP Problem

2010 ◽  
Vol 26-28 ◽  
pp. 620-624 ◽  
Author(s):  
Zhan Wei Du ◽  
Yong Jian Yang ◽  
Yong Xiong Sun ◽  
Chi Jun Zhang ◽  
Tuan Liang Li
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Convergence Time ◽  
Ant Colony Optimization Algorithm ◽  
Data Set ◽  
Research Attention ◽  
Simply Supported ◽  
Source Data

This paper presents a modified Ant Colony Algorithm(ACA) called route-update ant colony algorithm(RUACA). The research attention is focused on improving the computational efficiency in the TSP problem. A new impact factor is introduced and proved to be effective for reducing the convergence time in the RUACA performance. In order to assess the RUACA performance, a simply supported data set of cities, which was taken as the source data in previous research using traditional ACA and genetic algorithm(GA), is chosen as a benchmark case study. Comparing with the ACA and GA results, it is shown that the presented RUACA has successfully solved the TSP problem. The results of the proposed algorithm are found to be satisfactory.

Simulation of English text recognition model based on ant colony algorithm and genetic algorithm

2021 ◽  
pp. 1-12
Author(s):  
Fei Long
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Text Recognition ◽  
English Text ◽  
Recognition Model ◽  
Central Node ◽  
Model Based ◽  
Characteristic Points

The difficulty of English text recognition lies in fuzzy image text classification and part-of-speech classification. Traditional models have a high error rate in English text recognition. In order to improve the effect of English text recognition, guided by machine learning ideas, this paper combines ant colony algorithm and genetic algorithm to construct an English text recognition model based on machine learning. Moreover, based on the characteristics of ant colony intelligent algorithm optimization, a method of using ant colony algorithm to solve the central node is proposed. In addition, this paper uses the ant colony algorithm to obtain the characteristic points in the study area and determine a reasonable number, and then combine the uniform grid to select some non-characteristic points as the central node of the core function, and finally use the central node with a reasonable distribution for modeling. Finally, this paper designs experiments to verify the performance of the model constructed in this paper and combines mathematical statistics to visually display the experimental results using tables and graphs. The research results show that the performance of the model constructed in this paper is good.

scholarly journals Parameter Selection for Ant Colony Algorithm Based on Bacterial Foraging Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Peng Li ◽  
Hua Zhu
Keyword(s):  
Ant Colony Algorithm ◽  
Optimal Solution ◽  
Parameter Selection ◽  
Ant Colony ◽  
Multidimensional Space ◽  
Bacterial Foraging ◽  
Operation Speed ◽  
Local Optimal Solution ◽  
Bacterial Foraging Algorithm ◽  
Selection For

The optimal performance of the ant colony algorithm (ACA) mainly depends on suitable parameters; therefore, parameter selection for ACA is important. We propose a parameter selection method for ACA based on the bacterial foraging algorithm (BFA), considering the effects of coupling between different parameters. Firstly, parameters for ACA are mapped into a multidimensional space, using a chemotactic operator to ensure that each parameter group approaches the optimal value, speeding up the convergence for each parameter set. Secondly, the operation speed for optimizing the entire parameter set is accelerated using a reproduction operator. Finally, the elimination-dispersal operator is used to strengthen the global optimization of the parameters, which avoids falling into a local optimal solution. In order to validate the effectiveness of this method, the results were compared with those using a genetic algorithm (GA) and a particle swarm optimization (PSO), and simulations were conducted using different grid maps for robot path planning. The results indicated that parameter selection for ACA based on BFA was the superior method, able to determine the best parameter combination rapidly, accurately, and effectively.

Sign in / Sign up

Export Citation Format

Share Document