Windows | Games | Mobile | Wallpapers


Traveling Salesman Problem

Finds a near-optimal solution to a TSP using a GA


Last Week downloads: 0
Total downloads: 170
  • Last Updated: Jul 6, 2010
  • License: BSD Free
  • OS: Windows /Linux/Mac OS/BSD/Solaris
  • Requirements: Matlab 7.3 (R2006b)

User reviews

4 out of 5 based on 1 ratings for Traveling Salesman Problem

For Traveling Salesman Problem Publisher's description


Traveling Salesman Problem is a Scripts software developed by Joseph Kirk. After our trial and test, the software is proved to be official, secure and free. Here is the official description for Traveling Salesman Problem:

BrothersoftEditor: TSP_GA Traveling Salesman Problem (TSP) 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)

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

XY (float) is an Nx2 (or Nx3) matrix of cities
DMAT (float) is an NxN matrix of point to point distances/costs
POP_SIZE (scalar integer) is the size of the population (should be divisible by 4)
NUM_ITER (scalar integer) is the number of desired iterations for the algorithm to run
SHOW_PROG (scalar logical) shows the GA Progress if true
SHOW_RES (scalar logical) shows the GA results if true

OPT_RTE (integer array) is the best route found by the algorithm
MIN_DIST (scalar float) is the cost of the best route

n = 50;
xy = 10*rand(n,2);
a = meshgrid(1:n);
dmat = reshape(sqrt(sum((xy(a,:)-xy(a',:)).^2,2)),n,n);
pop_size = 60;
num_iter = 1e4;
show_prog = 1;
show_res = 1;
[opt_rte,min_dist] = tsp_ga(xy,dmat,pop_size,num_iter,show_prog,show_res);
you can free download Traveling Salesman Problem now.

For Traveling Salesman Problem Related Software


Please be aware that Brothersoft do not supply any crack, patches, serial numbers or keygen for Traveling Salesman Problem,and please consult directly with program authors for any problem with Traveling Salesman Problem.