An Approximate Algorithm Combining P Systems and Ant Colony Optimization for Traveling Salesman Problems

Abstract

This paper proposes an approximate optimization algorithm combining P systems with ant colony optimization, called ACOPS, to solve traveling salesman prob- lems, which are well-known and extensively studied NP-complete combinatorial optimization problems. ACOPS uses the pheromone model and pheromone update rules defined by ant colony optimization algorithms, and the hierarchical membrane structure and transformation/communication rules of P systems. First, the parameter setting of the ACOPS is discussed. Second, extensive experiments and statistical analysis are investigated. It is shown that the ACOPS is superior to Nishida's algorithms and its counterpart ant colony optimization algorithms, in terms of the quality of solutions and the number of function evaluations.