关于中国旅行商问题的探讨

Traveling Salesman Problems on China

对中国旅行商问题进行了探讨。首先,我们运用蚁群算法得到了中国旅行商的最短路旅行方案;其次,在最短路旅行方案的基础上,再考虑最经济的旅行花费问题,我们建立了旅行问题的无约束条件优化模型,同时得到了最小花费;最后,综合考虑省钱、省时又方便的约束条件,我们建立了旅行问题的均衡多目标优化模型,并运用Lingo软件编程最终得到了较合理的旅行订票方案。

China＇s traveling salesman problem is discussed.Firstly,ant colony algorithm is used to get the most short-circuit travel program of Chinese traveling salesman;Secondly,in most programs,based on the short trip,consider the most economical travel costs,we established a travel in the optimization model without constraints,while costs have been minimal;Finally,considering the money,save time and facilitate the constraints,we have established a travel in a balanced multi-objective optimization model,and software programming using Lingo finally get a more reasonable travel booking solution.