multiple-traveling salesmen problem from different
2016-08-23
0 0 0
no vote
Other
Earn points
Object: to achieve least distance for each circle
% Summary:
% 1. Each salesman starts at different points and ends at each starting
% point, also travels each city can be visited by more than one
% salesman
% Input:
% XY (float) is an Nx2 matrix of city locations, where N is the number of cities
% DMAT (float) is an NxN matrix of city-to-city distances or costs
% SALESMEN (scalar integer) is the number of salesmen to visit the cities
% MIN_TOU
% Summary:
% 1. Each salesman starts at different points and ends at each starting
% point, also travels each city can be visited by more than one
% salesman
% Input:
% XY (float) is an Nx2 matrix of city locations, where N is the number of cities
% DMAT (float) is an NxN matrix of city-to-city distances or costs
% SALESMEN (scalar integer) is the number of salesmen to visit the cities
% MIN_TOU
matlab
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment