2017
DOI: 10.14569/ijacsa.2017.080949
|View full text |Cite
|
Sign up to set email alerts
|

A P System for Solving All-Solutions of TSP

Abstract: 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 feasibilit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…The models of P system are mainly divided into three types, namely, the cell-like P system [2], the tissue-like P system [3] and the neural-like P system [4]. They have been applied to solve the problems such as NP problems [5]- [8], image processing [9], [10], arithmetic operations [11]- [14] and so on.…”
Section: Introductionmentioning
confidence: 99%
“…The models of P system are mainly divided into three types, namely, the cell-like P system [2], the tissue-like P system [3] and the neural-like P system [4]. They have been applied to solve the problems such as NP problems [5]- [8], image processing [9], [10], arithmetic operations [11]- [14] and so on.…”
Section: Introductionmentioning
confidence: 99%