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.

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

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.

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.