Repositorio de producción científica de la Universidad de Sevilla

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

Opened Access An Approximate Algorithm Combining P Systems and Ant Colony Optimization for Traveling Salesman Problems
Estadísticas
Icon
Exportar a
Autor: Zhang, Gexiang
Cheng, Jixiang
Gheorghe, Marian
Fecha: 2010
Publicado en: Proceedings of the Eighth Brainstorming Week on Membrane Computing, 321-340. Sevilla, E.T.S. de Ingeniería Informática, 1-5 de Febrero, 2010
ISBN/ISSN: 9788461423576
Tipo de documento: Ponencia
Resumen: 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.
Tamaño: 451.4Kb
Formato: PDF

URI: http://hdl.handle.net/11441/39205

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones