Traveling Salesman Problem - Solve in Matlab.

TOMLAB /MODELS Manual
Introduction to TOMLAB Models
Contents
1 The testprob collection
2 Linear Programming
3 Mixed-Integer Linear Programming
4 Quadratic Programming
5 Mixed-Integer Quadratic Programming
6 Mixed-Integer Quadratic w QC
7 Nonlinear Programming
8 Mixed-Integer Nonlinear Programming
9 Linear Least Squares
10 Nonlinear Least Squares Problems
11 Global Optimization
12 Constrained Global Optimization
13 Unconstrained Optimization
14 Linear Semi-Definite w LMI
15 Linear Semi-Definite w BMI
16 Constrained Goal Attainment
17 Geometric programming
18 Exponential Fitting
19 Traveling Salesman Problems
20 The modellib collection
21 Mining and Processing
22 Scheduling
23 Planning
24 Loading and Cutting
25 Ground transport
26 Air transport
27 Telecommunication
28 Economics
29 Timetabling
30 Public Services
31 The additional downloads collection
32 Additional linear.
33 Additional mixed-integer.
34 Additional quadratic.

19 Traveling Salesman Problems

In tsp_prob there are 25 traveling salesman problems. They are converted with the function makeInput in tsp_prob.m to mixed-integer linear problems. The field Prob.TSP contains the original input data. In order to define problem n and solve it, execute the following in Matlab:

  Prob = probInit('tsp_prob',n);
  Prob.PriLevOpt = 1;
  Prob.MIP.cpxControl.TILIM = 360;
  Result = tomRun('cplex', Prob, 1);

« Previous « Start » Next »