摘要
文章基于原禁忌搜索的思想,采用启发式信息求得初始解,然后在所有可能的邻域候选解中选最优,并讨论了其参数变化的效果影响,旨在实现简单TS算法,其次,以中国旅行商问题为例进行了测试并与传统的Hopfield神经网络,贪心算法求解进行了比较,禁忌搜索算法具有强健、快速和高效的特点,最后,文章对其后续发展前景赋予了极大的期望。
The original idea of tabu search based on heuristic information is adopted to obtain the initial solution,and then in the neighborhood of all possible candidate solutions in optimal selection,and discusses the influence of the effect of parameter variation,to achieve a simple algorithm,secondly,to Chinese traveling salesman problem as an example of the test and the traditional neural network,greedy algorithm for comparison,the tabu search algorithm has a strong,fast and efficient characteristics,finally,the subsequent improvement prospect.
作者
邓健
Deng Jian(College of Electronics and Information Engineering,Hunan University of Science and Engineering,Yongzhou 425199,China)
出处
《无线互联科技》
2018年第7期108-109,共2页
Wireless Internet Technology
关键词
禁忌搜索算法
旅行商
神经网络
贪心算法
tabu search algorithm
traveler
neural network
greedy algorithm
