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

摘要：

　　An approximate algorithm combining P system and active evolution algorithm to solve traveling salesman problem (TSPs) is proposed in this paper. The novel algorithm uses the same membrane structure, subalgorithms and transporting mechanisms from Nishidas algorithm, but adopts two classes of active evolution operators and a good initial solution generating method. Computer experiments show that the AEAPS gets better solutions than Nishidas shrink membrane algorithms and similar solutions with Zhangs algorithms in solving TSPs. But the necessary number of iterations using AEAPS is much less than both of them.

关键词： P systems active evolution algorithm traveling salesman problems

作者: Xiaoxiao Song Jun Wang

作者单位: School of Electrical and Information Engineering,Xihua University,Chengdu,Sichuan,610039,P.R. China

会议类型: 国际会议

会议名称: 2013年第二届亚洲膜计算国际会议(2013ACMC)

会议地点: 成都

会议语种:英文

页码: 221-232

在线出版日期: 2013-11-04（万方平台首次上网日期，不代表论文的发表时间）