Softpedia
 


SCRIPTS CATEGORIES:



NEWS ARCHIVE >>
SOFTPEDIA REVIEWS >>
MEET THE EDITORS >>
WEEK'S BEST
  • Koken 0.8.2
  • ContentBox 1.5.2
  • jQPlayer 0.5.2
  • SPOILER ALERT! 0.0.2
  • jQuery Mask Plugin 0.9.0
  • Easing Slider 2.1.2
  • Btapp.js 0.2.0
  • WiiFlash 0.4.5
  • Breeze.js 1.3.3
  • TinyMCE Templates 3.0.2
  • Home > Scripts > Programming Methods and Algorithms

    Multiple Traveling Salesmen Problem - Genetic Algorithm

    Download button

    Downloads: 823  Tell us about an update
    User Rating:
    Rated by:
    NOT RATED
    0 user(s)
    Developer:

    Website:

    License / Price:

    Platforms:

    Databases:

    Language:

    Last Updated:

    Category:
    Joseph Kirk | More scripts
    www.mathworks.com
    BSD License - BSD License 

    Windows / Linux / Mac OS / BSD / Solaris
    N/A
    Matlab
    July 30th, 2009, 09:25 GMT
    C: \ Programming Methods and Algorithms

     Read user reviews (0)  Refer to a friend  Subscribe

    Multiple Traveling Salesmen Problem - Genetic Algorithm description

    This MATLAB script finds a near-optimal solution to a Multiple Traveling Salesman Problem using a Genetic Algorithm

    The script needs starting locations for every salesman taken into account in the algorithm.

    It will find a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations).

    Requirements:

    · MATLAB 7.3 or higher



    TAGS:

    genetic algorith, | optimum route | generate graph | solution | MTSP | algorithm

    Go to top

    WindowsGamesDriversMacLinuxScriptsMobileHandheldNews

    SUBMIT PROGRAM   |   ADVERTISE   |   GET HELP   |   SEND US FEEDBACK   |   RSS FEEDS   |   UPDATE YOUR SOFTWARE   |   ROMANIAN FORUM