Journal Article10.1007/S00500-017-2796-Z
Physarum-energy optimization algorithm
Xiang Feng,Xiang Feng,Yang Liu,Huiqun Yu,Fei Luo +4 more
- 01 Sep 2017
- Vol. 23, Iss: 3, pp 871-888
14
TL;DR: The experiment results show that PEO has the advantages of excellent global optimization, high optimization accuracy and high parallelism and is significantly better than other algorithms.
read more
Abstract: In general, the existing evolutionary algorithms are prone to premature convergence and slow convergence in coping with combinatorial optimization problems. So an intelligent optimization algorithm called physarum-energy optimization algorithm (PEO) is proposed and put TSP as the carrier in this paper. This algorithm consists of four parts: the physarum biological model, the energy model, the age factor model and the stochastic disturbance model. First, the high parallelism of PEO is enlightened from the physarum’s low complexity and high parallelism. Second, we present an energy mechanism model in PEO, which is mainly to develop the shortcomings of existing algorithm, such as slow convergence and lack of interaction capability. Third, inspired by the characteristic of ants’ spatiotemporal variations, the age factor mechanism is introduced to raise search capacity, which can control the convergence speed and precision ability of PEO. In addition, in order to avoid premature convergence, the stochastic disturbance mechanism is adopted into PEO. And also the feasibility and convergence of PEO has been analyzed and verified theoretically. Moreover, we compare the algorithm and other algorithms to TSPs of diverse scope. The experiment results show that PEO has the advantages of excellent global optimization, high optimization accuracy and high parallelism and is significantly better than other algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Political Optimizer: A novel socio-inspired meta-heuristic for global optimization
TL;DR: The results show that PO outperforms all other algorithms, and consistency in performance on such a comprehensive suite of benchmark functions proves the versatility of the algorithm.
454
Stock exchange trading optimization algorithm: a human-inspired method for global optimization
TL;DR: In this paper, a human-inspired optimization algorithm called stock exchange trading optimization (SETO) for solving numerical and engineering problems is introduced, which is based on the behavior of traders and stock price changes in the stock market.
Nature-Inspired Algorithms from Oceans to Space: A Comprehensive Review of Heuristic and Meta-Heuristic Optimization Algorithms and Their Potential Applications in Drones
TL;DR: A review of nature-inspired algorithms in aerospace engineering is provided in this paper , which illustrates a general view of optimization problems in drones that are currently used and potential algorithms to solve them.
Political optimizer with interpolation strategy for global optimization.
TL;DR: In this article, a sequence of novel political optimizer (PO) variants were proposed by integrating PO with Quadratic Interpolation (QI) and interpolation strategy to help the current global optima jump out of local optima, and RL was integrated into PO to improve the diversity of the population.
A Slime Mold Fractional-Order Ant Colony Optimization Algorithm for Travelling Salesman Problems
Ziheng Rong,Xiaoling Gong,Xiangyu Wang,Wei Lv,Jian Wang +4 more
- 17 Jul 2021
TL;DR: Li et al. as mentioned in this paper proposed a slime mold fractional-order ant colony optimization (SMFACO) for TSPs, which takes full use of the long-term memory characteristics of the fractional calculus to balance exploration and exploitation.
4
References
Study on hybrid PS-ACO algorithm
TL;DR: The results show that the hybrid ACO algorithm modified by particle swarm optimization (PSO) algorithm has better convergence performance than genetic algorithm (GA), ACO and MMAS under the condition of limited evolution iterations.
95
An analysis of the fitness landscape of travelling salesman problem
TL;DR: The fitness landscape of the travelling salesman problem is investigated for 11 different types of the problem and it is shown how the properties of the principal components of the local optima change from one problem type to another.
Quadratic assignment problem: a landscape analysis
TL;DR: The anatomy of the fitness landscape for the quadratic assignment problem is studied, using auto-correlation as a measure for the landscape ruggedness, and how this property is related to the problem matrices with which the problems are represented.
30
Comparative Analysis of Genetic Algorithm and Ant Colony Algorithm on Solving Traveling Salesman Problem
Kangshun Li,Lanlan Kang,Wensheng Zhang,Bing Li +3 more
- 14 Jul 2008
TL;DR: Ant Colony Algorithm and Genetic Algorithm, two bionic-inspired optimization algorithms, have great potentials to solve the combination optimization problems, respectively used in solving traveling salesman problem, but there are some shortcomings if only one of them is used to solve TSP.
28
A Particle Swarm Optimization Algorithm with Ant Search for Solving Traveling Salesman Problem
Yuhong Duan,Sun Ying +1 more
- 11 Dec 2009
TL;DR: This work presents a hybrid discrete PSO algorithm with ant search for solving traveling salesman problem (TSP), and sets the initial pheromone trail based on the best chromosome of all particles to increase the diversity and improve the quality of the particle swarm.
11