A Novel PSO Algorithm for Traveling Salesman Problem Based on Dynamic Membrane System
Membrane computing is a class of distributed parallel computing model. In this paper, we propose a novel evolutionary computation method based on dynamic active membrane system. First, an improved particle swarm optimization based on neighborhood searching of every particle that called NPSO is proposed. That is, instead of learning from Pbest and Gbest during the whole evolution, the proposed NPSO learns from Pbest and NPbest (the NPbest is selected by the Neighborhood Searching Based Learning Strategy) in the early stage to preserve swarm diversity. After the predefined number of iterations, the NPSO switches into the conventional global version PSO to accelerate convergence speed. Second, in order to avoid suffering from premature convergence in the early stage, NPSO is partitioned into two stages that in the first stage is to preserve swarm diversity and in the second stage is to enhance the convergence speed towards global optimum. The classic Traveling Salesman Problem (TSP) is one of the most significant stochastic routing problems so we use the proposed NPSO to solve it. In fact, the NPSO can achieve better balance between exploration and exploitation as well. Experimental results show that the proposed NPSO algorithm is more superior or competitive.
KeywordsMembrane computing Particle swarm optimization algorithm TSP
- 2.Martin-Vide, C., Pazos, J., Păun, Gh.: A Rodriguez-Paton. Tissue P systems. Theoret. Comput. Sci. 296(2), 295–326 (2003)Google Scholar
- 3.Ionescu, M., Păun, Gh., Yokomori, T.: Spiking neural P systems. Fundamenta Informaticae 71(2–3), 279–308 (2006)Google Scholar
- 4.Păun, Gh., Rozenberg, G., Salomaa, A.: Membrane Computing. Oxford University Press, New York (2010)Google Scholar
- 5.Freund, R., Păun, Gh., Pérez-Jiménez, M.J.: Tissue-like P systems with channel-states. Theoret. Comput. Sci. 330(1), 101–116 (2005)Google Scholar
- 6.Păun, A., Păun, Gh.: The power of communication: P systems with symport/antiport. New Gen. Comput. 20, 295–305 (2002)Google Scholar