Rongchang Zhao, K. Zhan, Xiao-jun Li, Yide Ma, Xiaowen Feng
{"title":"Preventive Feedback PCNN Model and Its Application in the Combinatorial Optimization Problems","authors":"Rongchang Zhao, K. Zhan, Xiao-jun Li, Yide Ma, Xiaowen Feng","doi":"10.3969/J.ISSN.1001-0548.2013.05.018","DOIUrl":null,"url":null,"abstract":"An improved pulse coupled neural network(PCNN) model is proposed to solve combination optimization problem with help of PCNN auto-wave characteristic.Based on Tri-state cascading pulse coupled neural network(TCPCNN),a preventive feedback method by using the triangle inequality theorem is introduced.In the process of searching solutions,all solutions are judged by the triangle inequality theorem and solutions of poor quality are removed.Therefore,the solution space complexity of combinatorial optimization problems decreases and the efficiency and accuracy are improved.This algorithm is applied to the shor test path(SP) and the traveling salesman problem(TSP) simulations.The results show that the proposed algorithm can effectively reduce space complexity and further improve the searching speed.","PeriodicalId":35864,"journal":{"name":"电子科技大学学报","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"电子科技大学学报","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.3969/J.ISSN.1001-0548.2013.05.018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0
Abstract
An improved pulse coupled neural network(PCNN) model is proposed to solve combination optimization problem with help of PCNN auto-wave characteristic.Based on Tri-state cascading pulse coupled neural network(TCPCNN),a preventive feedback method by using the triangle inequality theorem is introduced.In the process of searching solutions,all solutions are judged by the triangle inequality theorem and solutions of poor quality are removed.Therefore,the solution space complexity of combinatorial optimization problems decreases and the efficiency and accuracy are improved.This algorithm is applied to the shor test path(SP) and the traveling salesman problem(TSP) simulations.The results show that the proposed algorithm can effectively reduce space complexity and further improve the searching speed.