Ant Colony Algorithm Based on Semantic Relations and its Applications

2014 ◽  
Vol 644-650 ◽  
pp. 2076-2080
Author(s):  
Yong Jian Yang ◽  
Jiu Xuan An ◽  
Hong Ying Han
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony Algorithm ◽  
Good Method ◽  
Ant Colony ◽  
Semantic Relations ◽  
Ant Colony Optimization Algorithm ◽  
Multi Stage ◽  
The Traveling Salesman Problem ◽  
Improved Ant Colony Algorithm ◽  
Improved Algorithm

Ant colony optimization algorithm (ACO) is a good method to solve complex multi-stage decision problems. But this algorithm is easy to fall into the local minimum points and has slowly convergence speed, According to the semantic relations, an improved ant colony algorithm has been proposed in this paper. In contrast with the tradition algorithm, the improved algorithm is added with a new operator to update crucial parameters. The new operator is to find out the potential semantic relations behind the history information based on ontology technology. Ant colony optimization can be applied to many engineering fields,taking the Traveling Salesman Problem (TSP) as example, Our experiments show accuracy of improved ant colony algorithm that is superior to that obtained by the other classical versions, and competitive or better than the results achieved by the compared algorithm, this improved algorithm also can improve the searching efficiency.

An Improved and Realized Volatility Strategy of the Ant Colony Optimization Algorithm

2013 ◽  
Vol 389 ◽  
pp. 849-853
Author(s):  
Fang Song Cui ◽  
Wei Feng ◽  
Da Zhi Pan ◽  
Guo Zhong Cheng ◽  
Shuang Yang
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Optimal Solution ◽  
Ant Colony ◽  
Ant System ◽  
Ant Colony Optimization Algorithm ◽  
Volatility Model ◽  
Local Optimal Solution ◽  
The Impact ◽  
Improved Algorithm

In order to overcome the shortcomings of precocity and stagnation in ant colony optimization algorithm, an improved algorithm is presented. Considering the impact that the distance between cities on volatility coefficient, this study presents an model of adjusting volatility coefficient called Volatility Model based on ant colony optimization (ACO) and Max-Min ant system. There are simulation experiments about TSP cases in TSPLIB, the results show that the improved algorithm effectively overcomes the shortcoming of easily getting an local optimal solution, and the average solutions are superior to ACO and Max-Min ant system.

Improved Ant Colony Algorithm for Optimal Solution TSP

2013 ◽  
Vol 765-767 ◽  
pp. 699-702
Author(s):  
Tian Yuan Zhou
Keyword(s):  
Traveling Salesman Problem ◽  
Ant Colony Algorithm ◽  
Search Strategy ◽  
Optimal Solution ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Algorithm Analysis ◽  
Simulation Testing ◽  
The Traveling Salesman Problem ◽  
Improved Ant Colony Algorithm

Based on the ant colony algorithm analysis and research, this paper proposed an improved ant colony algorithm. Through updating pheromone and optimal search strategy, then applied to the Traveling Salesman Problem (TSP), effectively improved the searching capability of the algorithm. Finally through the simulation testing and analysis, verified that the improved ant colony algorithm is effective, and has good performance.

Research on Application of Ant Colony Optimization

2014 ◽  
Vol 548-549 ◽  
pp. 1213-1216
Author(s):  
Wang Rui ◽  
Zai Tang Wang
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Optimal Algorithm ◽  
Convergence Speed ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Slow Convergence ◽  
Simulation Results ◽  
Research On Application

We research on application of ant colony optimization. In order to avoid the stagnation and slow convergence speed of ant colony algorithm, this paper propose the multiple ant colony optimization algorithm based on the equilibrium of distribution. The simulation results show that the optimal algorithm can have better balance in reducing stagnation and improving the convergence.

Parallel Ant Colony Optimization Algorithm Based on Multiplicate Pheromon Declining

2012 ◽  
Vol 433-440 ◽  
pp. 3577-3583
Author(s):  
Yan Zhang ◽  
Hao Wang ◽  
Yong Hua Zhang ◽  
Yun Chen ◽  
Xu Li
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Optimal Path ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Computing Power ◽  
Slow Convergence ◽  
The Impact

To overcome the defect of the classical ant colony algorithm’s slow convergence speed, and its vulnerability to local optimization, the authors propose Parallel Ant Colony Optimization Algorithm Based on Multiplicate Pheromon Declining to solve Traveling Salesman Problem according to the characteristics of natural ant colony multi-group and pheromone updating features of ant colony algorithm, combined with OpenMP parallel programming idea. The new algorithm combines three different pheromone updating methods to make a new declining pheromone updating method. It effectively reduces the impact of pheromone on the non-optimal path in the ants parade loop to subsequent ants and improves the parade quality of subsequent ants. It makes full use of multi-core CPU's computing power and improves the efficiency significantly. The new algorithm is compared with ACO through experiments. The results show that the new algorithm has faster convergence rate and better ability of global optimization than ACO.

Enhancing Collaborative Filtering Recommendation by Utilizing Improved Ant Colony Optimization Algorithm

2014 ◽  
Vol 556-562 ◽  
pp. 3793-3799
Author(s):  
Zhong Liang Li ◽  
Chen Xiao Hu ◽  
Xu Yang Wei ◽  
Teng Fei Zou ◽  
Hao Ran Zhang ◽  
...  
Keyword(s):  
Collaborative Filtering ◽  
Ant Colony Algorithm ◽  
Recommendation System ◽  
Ant Colony ◽  
Personalized Recommendation ◽  
Access Time ◽  
Ant Colony Optimization Algorithm ◽  
Access Frequency ◽  
Collaborative Filtering Algorithm ◽  
Improved Ant Colony Algorithm

Collaborative filtering (CF) is the most widely used and successful personalized recommendation technology in web usage mining. The traditional collaborative filtering algorithm based on user static evaluation of the item's neighbour to predict changes of the users’ interests, however, the user’s interest will make a difference over time. Taking the dynamic changes the user’s interest into account in the process, this paper presents a dynamic collaborative filtering recommendation method based on improved ant colony algorithm (EACF). Improved ant colony algorithm takes into account the user access time and access frequency, which can be more representative of the true interests of users. When generating the recommendation, this method not only takes into account the item’s score, but also will take into account intensity of “interest pheromone” on each item. Experimental results show that the EACF can significantly improve the prediction accuracy of the recommendation system compared with traditional CF.

scholarly journals Low-Energy Secure Routing Protocol for WSNs Based on Multiobjective Ant Colony Optimization Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Xueli Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Ant Colony Optimization Algorithm

As one of the three pillars of information technology, wireless sensor networks (WSNs) have been widely used in environmental detection, healthcare, military surveillance, industrial data sampling, and many other fields due to their unparalleled advantages in deployment cost, network power consumption, and versatility. The advent of the 5G standard and the era of Industry 4.0 have brought new opportunities for the development of wireless sensor networks. However, due to the limited power capacity of the sensor nodes themselves, the harsh deployment environment will bring a great difficulty to the energy replenishment of the sensor nodes, so the energy limitation problem has become a major factor limiting its further development; how to improve the energy utilization efficiency of WSNs has become an urgent problem in the scientific and industrial communities. Based on this, this paper researches the routing technology of wireless sensor networks, from the perspective of improving network security, and reducing network energy consumption, based on the study of ant colony optimization algorithm, further studies the node trust evaluation mechanism, and carries out the following research work: (1) study the energy consumption model of wireless sensor networks; (2) basic ant colony algorithm improvement; (3) multiobjective ant colony algorithm based on wireless sensor routing algorithm optimization. In this study, the NS2 network simulator is used as a simulation tool to verify the performance of the research algorithm. Compared with existing routing algorithms, the simulation results show that the multiobjective ant colony optimization algorithm has better performance in evaluation indexes such as life cycle, node energy consumption, node survival time, and stability compared with the traditional algorithm and the dual cluster head ant colony optimization algorithm.

Application of Emergency Logistics Distribution Routing Optimization Based on Improved Ant Colony Algorithm

2011 ◽  
Vol 268-270 ◽  
pp. 1726-1732 ◽  
Author(s):  
Li Yi Zhang ◽  
Teng Fei ◽  
Jin Zhang ◽  
Jie Li
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Delivery Time ◽  
Emergency Relief ◽  
Logistics Distribution ◽  
The Road ◽  
Routing Optimization ◽  
Emergency Logistics ◽  
Improved Ant Colony Algorithm

Emergency relief has characteristics of complexity, urgency, sustainability, technicality, and so on. In this paper a mathematical model to seek the shortest delivery time as the ultimate goal is established based on these characteristics, which is on the core of characteristics with the urgency and consider both the road conditions and on shortage of demand point of relief supplies. The problem of emergency logistics distribution routing optimization is solved by the improved ant colony algorithm—Fish-Swarm Ant Colony Optimization (FSACO), simulation results show that, compared with basic ant colony algorithm, Fish-Swarm Ant Colony Optimization can find the higher quality to solve the problem of emergency logistics distribution routing optimization.

scholarly journals Orderly Roulette Selection Based Ant Colony Algorithm for Hierarchical Multilabel Protein Function Prediction

2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
Zhengping Liang ◽  
Rui Guo ◽  
Jiangtao Sun ◽  
Zhong Ming ◽  
Zexuan Zhu
Keyword(s):  
Ant Colony Optimization ◽  
Protein Function ◽  
Ant Colony Algorithm ◽  
Protein Function Prediction ◽  
Function Prediction ◽  
Ant Colony ◽  
Classification Model ◽  
Selection Strategy ◽  
Classification Rules ◽  
Ant Colony Optimization Algorithm

Ant colony optimization (ACO) algorithms have been successfully applied to identify classification rules in data mining. This paper proposes a new ant colony optimization algorithm, named hmAntMinerorder, for the hierarchical multilabel classification problem in protein function prediction. The proposed algorithm is characterized by an orderly roulette selection strategy that distinguishes the merits of the data attributes through attributes importance ranking in classification model construction. A new pheromone update strategy is introduced to prevent the algorithm from getting trapped in local optima and thus leading to more efficient identification of classification rules. The comparison studies to other closely related algorithms on 16 publicly available datasets reveal the efficiency of the proposed algorithm.

Path Planning of Robot Based on Ant Colony Optimization Algorithm

2014 ◽  
Vol 614 ◽  
pp. 199-202 ◽  
Author(s):  
Bao Ming Shan ◽  
De Xiang Zhang
Keyword(s):  
Path Planning ◽  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Local Optimum ◽  
Robot Path Planning ◽  
Ant Colony Optimization Algorithm ◽  
Simulation Results ◽  
Robot Path

This paper presents a method for robot path planning based on ant colony optimization algorithm, in order to resolve the weakness of ant colony algorithm such as slow convergence rate and easy to fall into local optimum and traps. This method uses anti-potential field to make the robot escape from them smoothly, and at the end of each cycle, uses the way of judge first and then hybridization to optimize the algorithm. Finally, the simulation results show that the performance of the algorithm has been improved, and proved that the optimization algorithm is valid and feasible.

Sign in / Sign up

Export Citation Format

Share Document