Author(s)

Wenqian Zhang

Corresponding Author

Wenqian Zhang

ABSTRACT

Cell-like P systems are a class of distributed and parallel computing models. DNA genetic algorithms are evolutionary algorithm used for optimization purposes according to survival of the fittest idea, and DNA genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. Membrane computing (MC) combining with evolutionary computing (EC) is called evolutionary MC. This paper proposed an IDNA-DMS, which can not only easily get good approximation in time, but also converge rapidly. The experimental results show that the evolutionary MC algorithm IDNA-DMS can obtain more reliable optimization results with less iteration, which fully proves the effectiveness and efficiency of the algorithm.

KEYWORDS

Dna Genetic Algorithm, Membrane Computing, P System, Traveling Salesman Problem