An Approximate Algorithm Combining P Systems and Active Evolutionary Algorithms for Traveling Salesman Problems

作者：Song X^*; Wang J

来源：International Journal of Computers Communications & Control, 2015, 10(1): 89-99.

• P systems
• active evolutionary algorithms
• traveling salesman problems

An approximate algorithm combining P systems and active evolutionary algorithms (AEAPS) to solve traveling salesman problems (TSPs) is proposed in this paper. The novel algorithm uses the same membrane structure, subalgorithms and transporting mechanisms as Nishida's algorithm, but adopts two classes of active evolution operators and a good initial solution generating method. Computer experiments show that the AEAPS produces better solutions than Nishida's shrink membrane algorithm and similar solutions with an approximate optimization algorithm integrating P systems and ant colony optimization techniques (ACOPS) in solving TSPs. But the necessary number of iterations using AEAPS is less than both of them.

• 出版日期2015-2
• 单位西华大学