本项目利用IBM ILOG CPLEX优化软件高效求解NP难的旅行商问题(TSP)，通过建模和算法实现寻找最优或近似最优Hamilton回路。
利用商业软件cplex求解旅行商问题
Option Explicit
Private Type point
x As Double
y As Double
End Type
Private Type save
i As Long
j As Long
s As Double
End Type
Private points() As point, cost() As Double, saving() As save, n As Long, m As Long
Private trip() As String
5星
