• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2014, Vol. 36 ›› Issue (05): 947-950.

• 论文 • 上一篇    下一篇

基于LINGO的旅行商问题的建模方法

王继强   

  1. (山东财经大学数学与数量经济学院,山东 济南 250014)
  • 收稿日期:2012-11-12 修回日期:2013-03-05 出版日期:2014-05-25 发布日期:2014-05-25
  • 基金资助:

    国家自然科学基金资助项目(10901093)

LINGO-based modeling methods for
the traveling salesman problem         

WANG Jiqiang   

  1. (School of Mathematics and Quantitative Economics,Shandong University of Finance and Economics,Jinan 250014,China)
  • Received:2012-11-12 Revised:2013-03-05 Online:2014-05-25 Published:2014-05-25

摘要:

旅行商问题是图论中一类经典的最优化问题,其研究对于其他图优化问题的解决具有重要的理论意义和实际价值。针对旅行商问题建模中的困难之处——如何避免“分割”现象,提供了三种不同的解决方法,并给出了基于当今最流行的优化计算软件LINGO的实证分析。

关键词: 旅行商问题, 模型, 整数规划, LINGO

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.
 

Key words: traveling salesman problem;model;integer program;LINGO