scholarly journals TSP Solving Utilizing Improved Ant Colony Algorithm

2021 ◽  
Vol 2129 (1) ◽  
pp. 012026
Author(s):  
Xuan-Shi Yao ◽  
Yun Ou ◽  
Kai-Qing Zhou
Keyword(s):  
Mathematical Model ◽  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Optimal Path ◽  
Particle Swarm ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Swarm Optimization ◽  
Pheromone Concentration

Abstract To solve the premature issue of TSP solving using the ant colony optimization algorithm (ACO), this paper proposes an improved ACO using particle swarm optimization (PSO) to solve the classic traveling salesman problem (TSP). The algorithm’s strategy includes three stages: firstly, establishing a mathematical model according to the optimization objective, and then solving the optimal path obtained by the particle swarm optimization algorithm. Finally, the pheromone concentration of this path in the ant colony mathematical model is enhanced according to the particle swarm optimization algorithm’s optimal path. A classic TSP case is used to compare the PSO and ACO. The results show that the proposed improved algorithm has a faster convergence speed and can converge to the optimal global solution, and its performance is better than that of ACO and PSO.

scholarly journals Decision of Multimodal Transportation Scheme Based on Swarm Intelligence

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Kai Lei ◽  
Xiaoning Zhu ◽  
Jianfei Hou ◽  
Wencheng Huang
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Ant Colony ◽  
Swarm Optimization ◽  
Multimodal Transportation ◽  
Better Than

In this paper, some basic concepts of multimodal transportation and swarm intelligence were described and reviewed and analyzed related literatures of multimodal transportation scheme decision and swarm intelligence methods application areas. Then, this paper established a multimodal transportation scheme decision optimization mathematical model based on transportation costs, transportation time, and transportation risks, explained relevant parameters and the constraints of the model in detail, and used the weight coefficient to transform the multiobjective optimization problems into a single objective optimization transportation scheme decision problem. Then, this paper is proposed by combining particle swarm optimization algorithm and ant colony algorithm (PSACO) to solve the combinatorial optimization problem of multimodal transportation scheme decision for the first time; this algorithm effectively combines the advantages of particle swarm optimization algorithm and ant colony algorithm. The solution shows that the PSACO algorithm has two algorithms’ advantages and makes up their own problems; PSACO algorithm is better than ant colony algorithm in time efficiency and its accuracy is better than that of the particle swarm optimization algorithm, which is proved to be an effective heuristic algorithm to solve the problem about multimodal transportation scheme decision, and it can provide economical, reasonable, and safe transportation plan reference for the transportation decision makers.

Grid Task Scheduling Strategy Based on Particle Swarm Optimizationand Ant Colony Optimization Algorithm

2010 ◽  
Vol 108-111 ◽  
pp. 392-397
Author(s):  
Peng Cheng Wei ◽  
Xi Shi
Keyword(s):  
Particle Swarm Optimization ◽  
Ant Colony Optimization ◽  
Task Scheduling ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Scheduling Algorithm ◽  
Particle Swarm ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Swarm Optimization

Based on particle swarm optimization algorithm, this paper presents a grid scheduling optimization algorithm combing the advantages of Ant Colony optimization algorithm. The algorithm processes task scheduling through particle swarm optimization algorithm to get a group of relatively optimal solutions, and then conducts small-area local search with Ant Colony optimization algorithm. Theoretical analysis and results of the simulation experiments show that this scheduling algorithm effectively achieves load balancing of resources with comprehensive advantages in time efficiency and solution accuracy compared to the traditional Ant Colony optimization algorithm and particle swarm optimizationalgorithm, and can be applied to task scheduling in grid computing.

scholarly journals HYBRIDIZATION OF ANT COLONY ALGORITHM AND PARTICLE SWARM OPTIMIZATION ALGORITHM FOR REDUCTION OF REAL POWER LOSS

2018 ◽  
Vol 6 (12) ◽  
pp. 121-127
Author(s):  
K. Lenin
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Power Loss ◽  
Ant Colony Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Reactive Power ◽  
Particle Swarm ◽  
Ant Colony ◽  
Swarm Optimization ◽  
Real Power

In this work Ant colony optimization algorithm (ACO) & particle swarm optimization (PSO) algorithm has been hybridized (called as APA) to solve the optimal reactive power problem. In this algorithm, initial optimization is achieved by particle swarm optimization algorithm and then the optimization process is carry out by ACO around the best solution found by PSO to finely explore the design space. In order to evaluate the proposed APA, it has been tested on IEEE 300 bus system and compared to other standard algorithms. Simulations results show that proposed APA algorithm performs well in reducing the real power loss.

From Optimization to Clustering

2015 ◽  
pp. 594-619 ◽  
Author(s):  
Megha Vora ◽  
T. T. Mirnalinee
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Optimization Algorithm ◽  
Efficient Solution ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Ant Colony Optimization Algorithm ◽  
Swarm Optimization ◽  
Insight Into

In the past two decades, Swarm Intelligence (SI)-based optimization techniques have drawn the attention of many researchers for finding an efficient solution to optimization problems. Swarm intelligence techniques are characterized by their decentralized way of working that mimics the behavior of colony of ants, swarm of bees, flock of birds, or school of fishes. Algorithmic simplicity and effectiveness of swarm intelligence techniques have made it a powerful tool for solving global optimization problems. Simulation studies of the graceful, but unpredictable, choreography of bird flocks led to the design of the particle swarm optimization algorithm. Studies of the foraging behavior of ants resulted in the development of ant colony optimization algorithm. This chapter provides insight into swarm intelligence techniques, specifically particle swarm optimization and its variants. The objective of this chapter is twofold: First, it describes how swarm intelligence techniques are employed to solve various optimization problems. Second, it describes how swarm intelligence techniques are efficiently applied for clustering, by imposing clustering as an optimization problem.

From Optimization to Clustering

2016 ◽  
pp. 1519-1544 ◽  
Author(s):  
Megha Vora ◽  
T. T. Mirnalinee
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Optimization Algorithm ◽  
Efficient Solution ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Ant Colony Optimization Algorithm ◽  
Swarm Optimization ◽  
Insight Into

In the past two decades, Swarm Intelligence (SI)-based optimization techniques have drawn the attention of many researchers for finding an efficient solution to optimization problems. Swarm intelligence techniques are characterized by their decentralized way of working that mimics the behavior of colony of ants, swarm of bees, flock of birds, or school of fishes. Algorithmic simplicity and effectiveness of swarm intelligence techniques have made it a powerful tool for solving global optimization problems. Simulation studies of the graceful, but unpredictable, choreography of bird flocks led to the design of the particle swarm optimization algorithm. Studies of the foraging behavior of ants resulted in the development of ant colony optimization algorithm. This chapter provides insight into swarm intelligence techniques, specifically particle swarm optimization and its variants. The objective of this chapter is twofold: First, it describes how swarm intelligence techniques are employed to solve various optimization problems. Second, it describes how swarm intelligence techniques are efficiently applied for clustering, by imposing clustering as an optimization problem.

scholarly journals A Heuristic Elastic Particle Swarm Optimization Algorithm for Robot Path Planning

Information ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 99 ◽  
Author(s):  
Haiyan Wang ◽  
Zhiyu Zhou
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Mobile Robots ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimal Path ◽  
Particle Swarm ◽  
A Algorithm ◽  
Swarm Optimization ◽  
Elastic Particle

Path planning, as the core of navigation control for mobile robots, has become the focus of research in the field of mobile robots. Various path planning algorithms have been recently proposed. In this paper, in view of the advantages and disadvantages of different path planning algorithms, a heuristic elastic particle swarm algorithm is proposed. Using the path planned by the A* algorithm in a large-scale grid for global guidance, the elastic particle swarm optimization algorithm uses a shrinking operation to determine the globally optimal path formed by locally optimal nodes so that the particles can converge to it rapidly. Furthermore, in the iterative process, the diversity of the particles is ensured by a rebound operation. Computer simulation and real experimental results show that the proposed algorithm not only overcomes the shortcomings of the A* algorithm, which cannot yield the shortest path, but also avoids the problem of failure to converge to the globally optimal path, owing to a lack of heuristic information. Additionally, the proposed algorithm maintains the simplicity and high efficiency of both the algorithms.

Sign in / Sign up

Export Citation Format

Share Document