Abstract: P system is a parallel computing system based on a membrane computing model. Since the calculation process of the P system has the characteristics of maximum parallelism and Non-determinism, it has been used to solve the NP-hard problem in polynomial time. This paper designs a P system for TSP problem solving. This P system can not only determine whether the TSP problem has solution, but also give the allsolution when the TSP problem is solved. Finally, an example is given to illustrate the feasibility and effectiveness of the P system designed in this paper.

Ping Guo, Junqi Xiang, Jingya Xie and Jinhang Zheng, “A P System for Solving All-Solutions of TSP” International Journal of Advanced Computer Science and Applications(IJACSA), 8(9), 2017. http://dx.doi.org/10.14569/IJACSA.2017.080949

@article{Guo2017,
title = {A P System for Solving All-Solutions of TSP},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2017.080949},
url = {http://dx.doi.org/10.14569/IJACSA.2017.080949},
year = {2017},
publisher = {The Science and Information Organization},
volume = {8},
number = {9},
author = {Ping Guo and Junqi Xiang and Jingya Xie and Jinhang Zheng}
}