TSP
                            
                            于 2013-11-03 发布
                                                          文件大小:90KB
                                                        
                        
                                 0                                 205                            
                        
                                
                                下载积分:  1
                                下载次数:  6
                            
                            
                        代码说明:
求解TSP问题,即在N个城市中各经历一次回到出发点,使所经过的路程最短。采用连续的Hopfield网络实现以5个城市为例的TSP问题。(TSP problem, that each of the N cities experiencing a return to the starting point, so that the shortest distance elapsed. Use continuous Hopfield networks to five cities as an example of the TSP.)
下载说明:请别用迅雷下载,失败请重下,重下不扣分!
发表评论
                        
                        

