An improved Physarum polycephalum algorithm for the Steiner tree problem
by Yi Zhang; Zhengquan Yang; Xin Qi
International Journal of Bio-Inspired Computation (IJBIC), Vol. 19, No. 1, 2022

Abstract: In this paper, we present an improved algorithm based on the Physarum polycephalum model (PPM) to solve Steiner tree problem (STP). We use the improved method to calculate the minimum Steiner tree according to the faster convergence speed and higher precision of the origin PPM in solving the problem of network structure. We can maintain a stable output when calculating the optimal value in this model. Experiments show that the model has strong convergence efficiency, and the optimal value can be obtained in a small number of iterations. We can get more improvements compared with the optimal solutions of some datasets.

Online publication date: Mon, 07-Feb-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com