TSPOF_GA Fixed Open Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to a variation of the TSP by setting up
a GA to search for the shortest route (least distance for the salesman
to travel from a FIXED START to a FIXED END while visiting the other
cities exactly once)
Summary:
1. A single salesman starts at the first point, ends at the last
point, and travels to each of the remaining cities in between, but
does not close the loop by returning to the city he started from
2. Each city is visited by the salesman exactly once
Note: The Fixed Start is taken to be the first XY point, and the Fixed
End is taken to be the last XY point
Input:
USERCONFIG (structure) with zero or more of the following fields:
 XY (float) is an Nx2 matrix of city locations, where N is the number of cities
 DMAT (float) is an NxN matrix of point to point distances/costs
 POPSIZE (scalar integer) is the size of the population (should be divisible by 4)
 NUMITER (scalar integer) is the number of desired iterations for the algorithm to run
 SHOWPROG (scalar logical) shows the GA progress if true
 SHOWRESULT (scalar logical) shows the GA results if true
 SHOWWAITBAR (scalar logical) shows a waitbar if true
Input Notes:
1. Rather than passing in a structure containing these fields, any/all of
these inputs can be passed in as parameter/value pairs in any order instead.
2. Field/parameter names are case insensitive but must match exactly otherwise.
Output:
RESULTSTRUCT (structure) with the following fields:
(in addition to a record of the algorithm configuration)
 OPTROUTE (integer array) is the best route found by the algorithm
 MINDIST (scalar float) is the cost of the best route
Usage:
tspof_ga
or
tspof_ga(userConfig)
or
resultStruct = tspof_ga;
or
resultStruct = tspof_ga(userConfig);
or
[...] = tspof_ga('Param1',Value1,'Param2',Value2, ...);
Example:
% Let the function create an example problem to solve
tspof_ga;
Example:
% Request the output structure from the solver
resultStruct = tspof_ga;
Example:
% Pass a random set of userdefined XY points to the solver
userConfig = struct('xy',10*rand(50,2));
resultStruct = tspof_ga(userConfig);
Example:
% Pass a more interesting set of XY points to the solver
n = 50;
phi = (sqrt(5)1)/2;
theta = 2*pi*phi*(0:n1);
rho = (1:n).^phi;
[x,y] = pol2cart(theta(:),rho(:));
xy = 10*([x y]min([x;y]))/(max([x;y])min([x;y]));
userConfig = struct('xy',xy);
resultStruct = tspof_ga(userConfig);
Example:
% Pass a random set of 3D (XYZ) points to the solver
xyz = 10*rand(50,3);
userConfig = struct('xy',xyz);
resultStruct = tspof_ga(userConfig);
Example:
% Change the defaults for GA population size and number of iterations
userConfig = struct('popSize',200,'numIter',1e4);
resultStruct = tspof_ga(userConfig);
Example:
% Turn off the plots but show a waitbar
userConfig = struct('showProg',false,'showResult',false,'showWaitbar',true);
resultStruct = tspof_ga(userConfig);
1.3.0.0  Major overhaul of input/output interface. 

1.2.0.0  Bug fix. Minor cosmetic updates. 

1.1.0.0  Added 3D capability. 

1.0.0.0  updated help notes, description 
Inspired by: Traveling Salesman Problem  Genetic Algorithm
Create scripts with code, output, and formatted text in a single executable document.
Christoph Aoun (view profile)
There is an error which arises when only placing the input as a dmat. How can this be solved?
Gregory Johnson (view profile)
Very nice work!