Softpedia
 
HomepageWindowsGamesDriversMacLinuxScripts buttonMobileHandheldNews


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

    Traveling Salesman Problem - Nearest Neighbor

    Download button

    Downloads: 911  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:15 GMT
    C: \ Programming Methods and Algorithms

     Read user reviews (0)  Refer to a friend  Subscribe

    Traveling Salesman Problem - Nearest Neighbor description

    This MATLAB script finds a near-optimal solution to a TSP using Nearest Neighbor algorithm

    This method produces different results depending on what city is choosen as the starting point.

    This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes.

    Requirements:

    · MATLAB 7.6 or higher



    TAGS:

    		 traveling salesman person | nearest neighbor algorithm | optimum route | solution | TSP | route

    Go to top

    WindowsGamesDriversMacLinuxScriptsMobileHandheldNews

    SUBMIT PROGRAM   |   ADVERTISE   |   GET HELP   |   SEND US FEEDBACK   |   RSS FEEDS   |   UPDATE YOUR SOFTWARE   |   ROMANIAN FORUM
    © 2001 - 2013 Softpedia. All rights reserved.
    Softpedia® and the Softpedia® logo are
    registered trademarks of SoftNews NET SRL.    		 Copyright Information | Privacy Policy | Terms of Use