A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model

Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP.

The Physarum polycephalum Genome Reveals Extensive Use of Prokaryotic Two-Component and Metazoan-Type Tyrosine Kinase Signaling.

Physarum polycephalum is a well-studied microbial eukaryote with unique experimental attributes relative to other experimental model organisms. It has a sophisticated life cycle with several distinct stages including amoebal, flagellated, and plasmodial cells. It is unusual in switching between open and closed mitosis according to specific life-cycle stages. Here we present the analysis of the genome of this enigmatic and important model organism and compare it with closely related species. The genome is littered with simple and complex repeats and the coding regions are frequently interrupted by introns with a mean size of 100 bases. Complemented with extensive transcriptome data, we define approximately 31,000 gene loci, providing unexpected insights into early eukaryote evolution. We describe extensive use of histidine kinase-based two-component systems and tyrosine kinase signaling, the presence of bacterial and plant type photoreceptors (phytochromes, cryptochrome, and phototropin) and of plant-type pentatricopeptide repeat proteins, as well as metabolic pathways, and a cell cycle control system typically found in more complex eukaryotes. Our analysis characterizes P. polycephalum as a prototypical eukaryote with features attributed to the last common ancestor of Amorphea, that is, the Amoebozoa and Opisthokonts. Specifically, the presence of tyrosine kinases in Acanthamoeba and Physarum as representatives of two distantly related subdivisions of Amoebozoa argues against the later emergence of tyrosine kinase signaling in the opisthokont lineage and also against the acquisition by horizontal gene transfer.

An improved physarum centrality measure for weighted networks

Identification of the most central node within a network is one of the primary problems in network analysis. Among various centrality measures for weighted networks, most are based on the assumption that information only spreads through the shortest paths. Then, a mathematical model of an amoeboid organism has been used by Physarum centrality to relax the assumption. However, its computational complexity is relatively high by finding competing paths between all pairs of nodes in networks. In this paper, with the idea of a ground node, an improved Physarum centrality is proposed by maintaining the feature of original measure with the performance is greatly enhanced. Examples and applications are given to show the efficiency and effectiveness of our proposed measure in weighted networks.

A physarum network evolution model based on IBTM

The traditional Cellular Automation-based Physarum model reveals the process of amoebic self-organized movement and self-adaptive network formation based on bubble transportation. However, a bubble in the traditional Physarum model often transports within active zones and has little change to explore newareas.And the efficiency of evolution is very low because there is only one bubble in the system. This paper proposes an improved model, named as Improved Bubble Transportation Model (IBTM). Our model adds a time label for each grid of environment in order to drive bubbles to explore newareas, and deploysmultiple bubbles in order to improve the evolving efficiency of Physarum network.We first evaluate the morphological characteristics of IBTM with the real Physarum, and then compare the evolving time between the traditional model and IBTM. The results show that IBTM can obtain higher efficiency and stability in the process of forming an adaptive network.

An ant colony system based on the physarum network

The Physarum Network model exhibits the feature of important pipelines being reserved with the evolution of network during the process of solving a maze problem. Drawing on this feature, an Ant Colony System (ACS), denoted as PNACS, is proposed based on the Physarum Network (PN). When updating pheromone matrix, we should update both pheromone trails released by ants and the pheromones flowing in a network. This hybrid algorithm can overcome the low convergence rate and local optimal solution of ACS when solving the Traveling Salesman Problem (TSP). Some experiments in synthetic and benchmark networks show that the efficiency of PNACS is higher than that of ACS. More important, PNACS has strong robustness that is very useful for solving a higher dimension TSP.

Rapid Physarum Algorithm for shortest path problem

As shortest path (SP) problem has been one of the most fundamental network optimization problems for a long time, technologies for this problem are still being studied. In this paper, a new method by integrating a path finding mathematical model, inspired by Physarum polycephalum, with extracted one heuristic rule to solve SP problem has been proposed, which is called Rapid Physarum Algorithm (RPA). Simulation experiments have been carried out on three different network topologies with varying number of nodes. It is noted that the proposed RPA can find the optimal path as the path finding model does for most networks. What is more, experimental results show that the performance of RPA surpasses the path finding model on both iterations and solution time. © 2014 Elsevier B.V.

A Physarum-inspired multi-agent system to solve maze

Physarum Polycephalum is a primitive unicellular organism. Its foraging behavior demonstrates a unique feature to form a shortest path among food sources, which can be used to solve a maze. This paper proposes a Physarum-inspired multi-agent system to reveal the evolution of Physarum transportation networks. Two types of agents – one type for search and the other for convergence – are used in the proposed model, and three transition rules are identified to simulate the foraging behavior of Physarum. Based on the experiments conducted, the proposed multiagent system can solve the two possible routes of maze, and exhibits the reconfiguration ability when cutting down one route. This indicates that the proposed system is a new way to reveal the intelligence of Physarum during the evolution process of its transportation networks.

A novel Physarum-Based ant colony system for solving the real-world traveling salesman problem

The solutions to Traveling Salesman Problem can be widely applied in many real-world problems. Ant colony optimization algorithms can provide an approximate solution to a Traveling Salesman Problem. However, most ant colony optimization algorithms suffer premature convergence and low convergence rate. With these observations in mind, a novel ant colony system is proposed, which employs the unique feature of critical tubes reserved in the Physaurm-inspired mathematical model. A series of experiments are conducted, which are consolidated by two realworld Traveling Salesman Problems. The experimental results show that the proposed new ant colony system outperforms classical ant colony system, genetic algorithm, and particle swarm optimization algorithm in efficiency and robustness.

A multi-objective ant colony optimization algorithm based on the physarum-inspired mathematical model

Multi-objective traveling salesman problem (MOTSP) is an important field in operations research, which has wide applications in the real world. Multi-objective ant colony optimization (MOACO) as one of the most effective algorithms has gained popularity for solving a MOTSP. However, there exists the problem of premature convergence in most of MOACO algorithms. With this observation in mind, an improved multiobjective network ant colony optimization, denoted as PMMONACO, is proposed, which employs the unique feature of critical tubes reserved in the network evolution process of the Physarum-inspired mathematical model (PMM). By considering both pheromones deposited by ants and flowing in the Physarum network, PM-MONACO uses an optimized pheromone matrix updating strategy. Experimental results in benchmark networks show that PM-MONACO can achieve a better compromise solution than the original MOACO algorithm for solving MOTSPs.

A new model to imitate the foraging behavior of Physarum polycephalum on a nutrient-poor substrate

Researches on Physarum polycephalum show that methods inspired by the primitive unicellular organism can construct an efficient network and solve some complex problems in graph theory. Current models simulating the intelligent behavior of Physarum are mainly based on Hagen-Poiseuille Law and Kirchhoff Law, reaction-diffusion, Cellular Automaton and multi-agent approach. In this paper, based on an assumption that the plasmodium of Physarum forages for food along the gradient of chemo-attractants on a nutrient-poor substrate, a new model is proposed to imitate its intelligent foraging behavior. The key point of the model is that the growth of Physarum is determined by the simple particle concentration field relating the distance to food source and the shape of food source on a nutrient-poor substrate. To verify this model, numerical experiments are conducted according to Adamatzky[U+05F3]s experiment. Results in spanning tree construction by this model are almost the same as those of Physarum and Oregonator model. The proposed model can also imitate Physarum to avoid repellents. Furthermore, the Euclidean Spanning tree built by this model is similar to its corresponding Minimal Euclidean Spanning tree.

A new multi-agent system to simulate the foraging behaviors of Physarum

Physarum Polycephalum is a unicellular and multi-headed slime mold, which can form high efficient networks connecting spatially separated food sources in the process of foraging. Such adaptive networks exhibit a unique characteristic in which network length and fault tolerance are appropriately balanced. Based on the biological observations, the foraging process of Physarum demonstrates two self-organized behaviors, i.e., search and contraction. In this paper, these two behaviors are captured in a multi-agent system. Two types of agents and three transition rules are designed to imitate the search and the contraction behaviors of Physarum based on the necessary and the sufficient conditions of a self-organized computational system. Some simulations of foraging process are used to investigate the characteristics of our system. Experimental results show that our system can autonomously search for food sources and then converge to a stable solution, which replicates the foraging process of Physarum. Specially, a case study of maze problem is used to estimate the path-finding ability of the foraging behaviors of Physarum. What’s more, the model inspired by the foraging behaviors of Physarum is proposed to optimize meta-heuristic algorithms for solving optimization problems. Through comparing the optimized algorithms and the corresponding traditional algorithms, we have found that the optimization strategies have a higher computational performance than their corresponding traditional algorithms, which further justifies that the foraging behaviors of Physarum have a higher computational ability.

A new physarum network based genetic algorithm for bandwidth-delay constrained least-cost multicast routing

Bandwidth-delay constrained least-cost multicast routing is a typical NP-complete problem. Although some swarm-based intelligent algorithms (e.g., genetic algorithm (GA)) are proposed to solve this problem, the shortcomings of local search affect the computational effectiveness. Taking the ability of building a robust network of Physarum network model (PN), a new hybrid algorithm, Physarum network-based genetic algorithm (named as PNGA), is proposed in this paper. In PNGA, an updating strategy based on PN is used for improving the crossover operator of traditional GA, in which the same parts of parent chromosomes are reserved and the new offspring by the Physarum network model is generated. In order to estimate the effectiveness of our proposed optimized strategy, some typical genetic algorithms and the proposed PNGA are compared for solving multicast routing. The experiments show that PNGA has more efficient than original GA. More importantly, the PNGA is more robustness that is very important for solving the multicast routing problem.

A new physarum-based hybrid optimization algorithm for solving 0/1 knapsack problem

As a typical NP-complete problem, 0/1 Knapsack Problem (KP), has been widely applied in many domains for solving practical problems. Although ant colony optimization (ACO) algorithms can obtain approximate solutions to 0/1 KP, there exist some shortcomings such as the low convergence rate, premature convergence and weak robustness. In order to get rid of the above-mentioned shortcomings, this paper proposes a new kind of Physarum-based hybrid optimization algorithm, denoted as PM-ACO, based on the critical paths reserved by Physarum-inspired mathematical (PM) model. By releasing additional pheromone to items that are on the important pipelines of PM model, PM-ACO algorithms can enhance item pheromone matrix and realize a positive feedback process of updating item pheromone. The experimental results in two different datasets show that PM-ACO algorithms have a stronger robustness and a higher convergence rate compared with traditional ACO algorithms.

A physarum-inspired vacant-particle model with shrinkage for transport network design

Physarum can form a higher efficient and stronger robust network in the processing of foraging. The vacant-particle model with shrinkage (VP-S model), which captures the relationship between the movement of Physarum and the process of network formation, can construct a network with a good balance between exploration and exploitation. In this paper, the VP-S model is applied to design a transport network. We compare the performance of the network designed based on the VP-S model with the real-world transport network in terms of average path length, network efficiency and topology robustness. Experimental results show that the network designed based on the VP-S model has better performance than the real-world transport network in all measurements. Our study indicates that the Physarum-inspired model can provide useful suggestions to the real-world transport network design.