| 基于LINGO的旅行商问题的建模方法 |
| |
| 引用本文： | 王继强.基于LINGO的旅行商问题的建模方法[J].计算机工程与科学,2014,36(5):947-950. |
| |
| 作者姓名： | 王继强 |
| |
| 基金项目： | 国家自然科学基金资助项目(10901093) |
| |
| 摘 要： | 旅行商问题是图论中一类经典的最优化问题，其研究对于其他图优化问题的解决具有重要的理论意义和实际价值。针对旅行商问题建模中的困难之处--如何避免“分割”现象，提供了三种不同的解决方法，并给出了基于当今最流行的优化计算软件LINGO的实证分析。
|
| 关 键 词： | 旅行商问题 模型 整数规划 LINGO |
| 收稿时间： | 2012-11-12 |
| 修稿时间： | 2014-05-25 |
LINGO-based modeling methods for
the traveling salesman problem |
| |
| WANG Ji qiang.LINGO-based modeling methods for
the traveling salesman problem[J].Computer Engineering & Science,2014,36(5):947-950. |
| |
| Authors: | WANG Ji qiang |
| |
| Affiliation: | (School of Mathematics and Quantitative Economics,Shandong University of Finance and Economics,Jinan 250014,China) |
| |
| Abstract: | The traveling salesman problem is a classical optimization problem in graph theory. Its research has important theoretical meaning and practical value for other graphic optimization problems.Aiming at the difficulty in modeling the traveling salesman problem how to avoid the “separation”phenomenon, three different solutions are proposed. Finally,a case study based on LINGO,the most popular optimization softwares, is given. |
| |
| Keywords: | traveling salesman problem model integer program LINGO |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载全文 |
