Traveling Salesman Problem Matlab script

Publisher review:
Traveling Salesman Problem solves the TSP by implementing a GA Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)Variable inputs: NUM_CITIES or CITIES and/or several optional input parametersNUM_CITIES is an integer representing the number of citiesCITIES is an Nx2 matrix representing XY coordinates for N user specified citiesOptions include ...'-NOPLOT', which turns off the GA progress plot'-RESULTS', which turns on some plots at the end of the GA'POPSIZE',VAL, sets the GA population size to be VAL'MRATE',VAL, sets the mutation rate to VAL'NUMITER',VAL, sets the number of GA iterations to VALOutputs:SORTED_CITIES is the CITIES matrix sorted by the best routeBEST_ROUTE is a 1xN vector representing the input city order,SHORTEST_DISTANCE is the distance between all of the cities along the best routeExample usage:>> [sorted_cities, best_route, distance] = tsp_ga(40, 'popsize',80, 'numiter',250, '-results'); % Solves the TSP for 40 randomly generated cities with a population size of 80 and 250 iterations, as well as plotting the results.Notes:1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a 'parameter', value Requirements: · MATLAB Release: R2006b
Operating system:
Windows / Linux / Mac OS / BSD / Solaris

DOWNLOAD TRAVELING SALESMAN PROBLEM NOW!

222

22

Posted on: 18 Jul 2023 22:27 by A. Brown

111

111

Posted on: 18 Jul 2023 22:24 by A. Brown

The new Firefox 37 comes with improved HTTP / 2 and superior HMTL5 compatibility with YouTube

Hacked by !Sc-sT

Posted on: 03 Apr 2015 11:11 by A. Brown

The permanently active Push system offered by the new Google Chrome 42

Hacked By !Sc-sT

Posted on: 17 Mar 2015 07:57 by A. Brown