摘要
旅行商问题是图论中一类经典的最优化问题,其研究对于其他图优化问题的解决具有重要的理论意义和实际价值。针对旅行商问题建模中的困难之处——如何避免"分割"现象,提供了三种不同的解决方法,并给出了基于当今最流行的优化计算软件LINGO的实证分析。
The traveling salesman problem is a classical optimization problem in graph theory. Its re- search has important theoretical meaning and practical value for other graphic optimization problems. Ai- ming at the difficulty in modeling the traveling salesman problem-how to avoid the ＂separation＂phenom- enon, three different solutions are proposed. Finally,a case study based on LINGO, the most popular optimization softwares, is given.
出处
《计算机工程与科学》
CSCD
北大核心
2014年第5期947-950,共4页
Computer Engineering & Science
基金
国家自然科学基金资助项目(10901093)
