| TSP及其扩展问题的混合型启发式算法 |
| |
| 引用本文： | 马良.TSP及其扩展问题的混合型启发式算法[J].上海理工大学学报(社会科学版),1999(1):25-28. |
| |
| 作者姓名： | 马良 |
| |
| 作者单位： | 上海理工大学系统科学与系统工程学院 |
| |
| 摘 要： | 就经典的旅行商问题（ＴＳＰ）及其扩展形式；瓶颈问题、多目标问题等给出一种混合型启发式算法，并知微机上予以实现，为困难的扩展型ＴＳＰ提供了新的求解手段。
|
| 关 键 词： | TSP 模拟退火 遗传算法 蚂蚁算法 旅行商问题 |
Hybrid heuristic algorithm for the TSP and its extended problems |
| |
| Ma Liang.Hybrid heuristic algorithm for the TSP and its extended problems[J].Journal of University of Shanghai For Science and Technilogy(Social Science),1999(1):25-28. |
| |
| Authors: | Ma Liang |
| |
| Abstract: | Travelling salesman problem is a kind of complex NP-hard combinatorial optimization problem, which can be approximated only by heuristic algorithms. In the paper, a hybrid heuristic heuristic algorithm is presented for the classical travelling salesman problem ( TSP ) and its extended form, such as bottleneck problem, multicriteria problem, etc. The algorithm offered consists of simulated annealing algorithm, genetic algorithm, genetic algorithm and ant algorithm. This composite algorithm and be modified to solve the extended TSP. Numerical examples are tested on microcomputers, which give satisfactory results. |
| |
| Keywords: | TSP simulated annealing genetic algorithm ant algorithm |
|
| 点击此处可从《上海理工大学学报(社会科学版)》浏览原始摘要信息 |
| 点击此处可从《上海理工大学学报(社会科学版)》下载免费的PDF全文 |
