An asynchronous P system with improved branch and bound for solving the minimum Steiner tree

In the membrane computing, which is a computational model inspired by the activity of living cells, several algorithms have been proposed for computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction in the number of membranes must be considered in order to make the membrane computing a more realistic model.In the present paper, we propose an asynchronous P system using improved branch and bound to solve the minimum Steiner tree problem. The experimental results show the validity and efficiency of the proposed P system.