Scribd
Upload
193 views

Genetic Algorithm

This genetic algorithm finds the shortest route for a traveling salesman problem (TSP) by having a population of routes evolve over iterations to minimize the total distance traveled. It takes input parameters like city locations and distances, population size, and number of iterations. The output includes the optimal route found and minimum distance.

Uploaded by

Shashikant Chaurasia
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
193 views

Genetic Algorithm

This genetic algorithm finds the shortest route for a traveling salesman problem (TSP) by having a population of routes evolve over iterations to minimize the total distance traveled. It takes input parameters like city locations and distances, population size, and number of iterations. The output includes the optimal route found and minimum distance.

Uploaded by

Shashikant Chaurasia
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

% Genetic Algorithm (GA)

%
Finds a (near) optimal solution to the TSP by setting up a GA to search
%
for the shortest route (least distance for the salesman to travel to
%
each city exactly once and return to the starting city)
%
% Summary:
%
1. A single salesman travels to each of the cities and completes the
%
route by returning to the city he started from
%
2. Each city is visited by the salesman exactly once
%
% 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:
%
tsp_ga
%
-or%
tsp_ga(userConfig)
%
-or%
resultStruct = tsp_ga;
%
-or%
resultStruct = tsp_ga(userConfig);
%
-or%
[...] = tsp_ga('Param1',Value1,'Param2',Value2, ...);
%
% Example:
%
% Let the function create an example problem to solve
%
tsp_ga;
%
% Example:
%
% Request the output structure from the solver
%
resultStruct = tsp_ga;
%
% Example:

%
% Pass a random set of user-defined XY points to the solver
%
userConfig = struct('xy',10*rand(50,2));
%
resultStruct = tsp_ga(userConfig);
%
% Example:
%
% Pass a more interesting set of XY points to the solver
%
n = 100;
%
phi = (sqrt(5)-1)/2;
%
theta = 2*pi*phi*(0:n-1);
%
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 = tsp_ga(userConfig);
%
% Example:
%
% Pass a random set of 3D (XYZ) points to the solver
%
xyz = 10*rand(50,3);
%
userConfig = struct('xy',xyz);
%
resultStruct = tsp_ga(userConfig);
%
% Example:
%
% Change the defaults for GA population size and number of iterations
%
userConfig = struct('popSize',200,'numIter',1e4);
%
resultStruct = tsp_ga(userConfig);
%
% Example:
%
% Turn off the plots but show a waitbar
%
userConfig =
struct('showProg',false,'showResult',false,'showWaitbar',true);
%
resultStruct = tsp_ga(userConfig);
%
% See also: mtsp_ga, tsp_nn, tspo_ga, tspof_ga, tspofs_ga, distmat
%
% Author: Joseph Kirk
% Email: [email protected]
% Release: 3.0
% Release Date: 05/01/2014
function varargout = tsp_ga(varargin)
% Initialize default configuration
defaultConfig.xy
= 10*rand(50,2);
defaultConfig.dmat
= [];
defaultConfig.popSize
= 100;
defaultConfig.numIter
= 1e4;
defaultConfig.showProg
= true;
defaultConfig.showResult = true;
defaultConfig.showWaitbar = false;
% Interpret user configuration inputs
if ~nargin
userConfig = struct();
elseif isstruct(varargin{1})
userConfig = varargin{1};
else
try

userConfig = struct(varargin{:});
catch
error('Expected inputs are either a structure or parameter/value

pairs');
end

end

% Override default configuration with user inputs


configStruct = get_config(defaultConfig,userConfig);
% Extract configuration
xy
= configStruct.xy;
dmat
= configStruct.dmat;
popSize
= configStruct.popSize;
numIter
= configStruct.numIter;
showProg
= configStruct.showProg;
showResult = configStruct.showResult;
showWaitbar = configStruct.showWaitbar;
if isempty(dmat)
nPoints = size(xy,1);
a = meshgrid(1:nPoints);
dmat = reshape(sqrt(sum((xy(a,:)-xy(a',:)).^2,2)),nPoints,nPoints);
end
% Verify Inputs
[N,dims] = size(xy);
[nr,nc] = size(dmat);
if N ~= nr || N ~= nc
error('Invalid XY or DMAT inputs!')
end
n = N;
% Sanity Checks
popSize
= 4*ceil(popSize/4);
numIter
= max(1,round(real(numIter(1))));
showProg
= logical(showProg(1));
showResult = logical(showResult(1));
showWaitbar = logical(showWaitbar(1));
% Initialize the Population
pop = zeros(popSize,n);
pop(1,:) = (1:n);
for k = 2:popSize
pop(k,:) = randperm(n);
end
% Run the GA
globalMin = Inf;
totalDist = zeros(1,popSize);
distHistory = zeros(1,numIter);
tmpPop = zeros(4,n);
newPop = zeros(popSize,n);
if showProg
figure('Name','TSP_GA | Current Best Solution','Numbertitle','off');
hAx = gca;
end

if showWaitbar
hWait = waitbar(0,'Searching for near-optimal solution ...');
end
for iter = 1:numIter
% Evaluate Each Population Member (Calculate Total Distance)
for p = 1:popSize
d = dmat(pop(p,n),pop(p,1)); % Closed Path
for k = 2:n
d = d + dmat(pop(p,k-1),pop(p,k));
end
totalDist(p) = d;
end
% Find the Best Route in the Population
[minDist,index] = min(totalDist);
distHistory(iter) = minDist;
if minDist < globalMin
globalMin = minDist;
optRoute = pop(index,:);
if showProg
% Plot the Best Route
rte = optRoute([1:n 1]);
if dims > 2, plot3(hAx,xy(rte,1),xy(rte,2),xy(rte,3),'r.-');
else plot(hAx,xy(rte,1),xy(rte,2),'r.-'); end
title(hAx,sprintf('Total Distance = %1.4f, Iteration =
%d',minDist,iter));
drawnow;
end
end
% Genetic Algorithm Operators
randomOrder = randperm(popSize);
for p = 4:4:popSize
rtes = pop(randomOrder(p-3:p),:);
dists = totalDist(randomOrder(p-3:p));
[ignore,idx] = min(dists); %#ok
bestOf4Route = rtes(idx,:);
routeInsertionPoints = sort(ceil(n*rand(1,2)));
I = routeInsertionPoints(1);
J = routeInsertionPoints(2);
for k = 1:4 % Mutate the Best to get Three New Routes
tmpPop(k,:) = bestOf4Route;
switch k
case 2 % Flip
tmpPop(k,I:J) = tmpPop(k,J:-1:I);
case 3 % Swap
tmpPop(k,[I J]) = tmpPop(k,[J I]);
case 4 % Slide
tmpPop(k,I:J) = tmpPop(k,[I+1:J I]);
otherwise % Do Nothing
end
end
newPop(p-3:p,:) = tmpPop;
end
pop = newPop;

% Update the waitbar


if showWaitbar && ~mod(iter,ceil(numIter/325))
waitbar(iter/numIter,hWait);
end
end
if showWaitbar
close(hWait);
end
if showResult
% Plots the GA Results
figure('Name','TSP_GA | Results','Numbertitle','off');
subplot(2,2,1);
pclr = ~get(0,'DefaultAxesColor');
if dims > 2, plot3(xy(:,1),xy(:,2),xy(:,3),'.','Color',pclr);
else plot(xy(:,1),xy(:,2),'.','Color',pclr); end
title('City Locations');
subplot(2,2,2);
imagesc(dmat(optRoute,optRoute));
title('Distance Matrix');
subplot(2,2,3);
rte = optRoute([1:n 1]);
if dims > 2, plot3(xy(rte,1),xy(rte,2),xy(rte,3),'r.-');
else plot(xy(rte,1),xy(rte,2),'r.-'); end
title(sprintf('Total Distance = %1.4f',minDist));
subplot(2,2,4);
plot(distHistory,'b','LineWidth',2);
title('Best Solution History');
set(gca,'XLim',[0 numIter+1],'YLim',[0 1.1*max([1 distHistory])]);
end
% Return Output
if nargout
resultStruct = struct( ...
'xy',
xy, ...
'dmat',
dmat, ...
'popSize',
popSize, ...
'numIter',
numIter, ...
'showProg',
showProg, ...
'showResult', showResult, ...
'showWaitbar', showWaitbar, ...
'optRoute',
optRoute, ...
'minDist',
minDist);
varargout = {resultStruct};
end
end
% Subfunction to override the default configuration with user inputs
function config = get_config(defaultConfig,userConfig)
% Initialize the configuration structure as the default
config = defaultConfig;

% Extract the field names of the default configuration structure


defaultFields = fieldnames(defaultConfig);
% Extract the field names of the user configuration structure
userFields = fieldnames(userConfig);
nUserFields = length(userFields);
% Override any default configuration fields with user values
for i = 1:nUserFields
userField = userFields{i};
isField = strcmpi(defaultFields,userField);
if nnz(isField) == 1
thisField = defaultFields{isField};
config.(thisField) = userConfig.(userField);
end
end
end

You might also like