摘要
TSP旅行商(货郎担)问题是诸多领域内出现的多种复杂问题的集中概括和简化形式,同时也是一个典型的易于描述却难以处理的NP完全问题。基于不同的算法分析出现了许多解决TSP问题的方法。分析研究了大量TSP算法,例如遗传算法、神经网络法、回溯法、蚂蚁演算法、神经网络优化法、列表寻优(TABU)法及模拟退火法等,并对其中的两种算法作了较为详细的介绍,对环路构造法提出了一种优化算法。
In recent years,TSP（Traveling Salesman Problem） in logistics distribution vehicle traveling route of application research is very active.TSP is the concentrated generality and simplified form of many complicated problem emerging from all kinds of field.And it is also a typical easy to describe but difficult to deal with the NP problem.There are many ways to solve TSP problem based on the analysis of different algorithms.This paper analyzes the algorithm of TSP,such as genetic algorithms,neural network optimization,list（TABU） method and simulated annealing method,and two of the three algorithm for a more detailed introduction,loop structure method to put forward a kind of optimization algorithm.
出处
《软件导刊》
2012年第6期93-95,共3页
Software Guide
关键词
TSP
物流配送
模拟退火法
遗传算法
启发式算法
TSP
Logistics Distribution
Simulated Annealing
Genetic Algorithm
Heuristic Algorithm
