Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Vue Injector 3.3
Spectrum Analyzer pro Live 2019
Devart Excel Add-in for HubSpot 2.1
RentALLScript - Airbnb clone 2.2
SuiteCRM Theme Customization 7.11.6
iScripts NetMenus 3.1
iScripts EasyIndex 2.2
iScripts EasySnaps 2.0
Australia MyPost shipping For Magento 2 1.0.0
Australia Post eParcel For Magento 1.1.1
Source Control for SQL Server 2.0
Answers phpSoftPro 3.12
Exlcart 2.0
School College ERP 1.3.2
White-label Grocery Delivery App Solution 2.0
Top Code
IcrediBB Bulletin Board System 1.0
iScripts EasySnaps 1
iScripts EasyIndex 1
iScripts NetMenus 2.0
Image Encryption 1.0
OpenCV Delphi wrapper 1.0
PAWS 0.2
Password protection by razalgar 1.I
Complete ASP Chat Application
trail and error by using matlab code 1.0
Scott Brady's Password Protection 1.0
ASP Chat Application 2.0
Cleans Matlab syntax 1.0
Paypal Clone Script 1.0.9
Simple Password Gate 1
Top Rated
phpEnter 5.1.
Quick Maps For Dynamics CRM 3.1
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Traveling Salesman Problem - Nearest Neighbor Script 1.1
File ID: 87000






Traveling Salesman Problem - Nearest Neighbor Script 1.1
Download Traveling Salesman Problem - Nearest Neighbor Script 1.1http://www.mathworks.com/Report Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 95
Submit Rating:
Traveling Salesman Problem - Nearest Neighbor Script 1.1 Description
Description: 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.

License: Freeware

Related: routes, starting, nearest, neighbor, Multiple, returns, points, determines, Function, produces, results, depending, pointthis, choosen, method

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 95



More Similar Code

simulatedannealing() is an optimization routine for traveling salesman problem. Any dataset from the TSPLIB can be suitably modified and can be used with this routine. A detailed description about the function is included in "Simulated_Annealing_Support_Document.pdf."

A GUI is used with the core function to visualize and to vary annealing parameters.

Four sample data set from TSPLIB is provided. You can create...



Heuristic method for the Traveling Salesman Problem (TSP)
A number of nearest neighbour tours are generated from randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is...



Genetic Algorithm based software to resolve the Traveling Salesman Problem (Problema del Commesso Viaggiatore).



Connects randomly ordered 2D points into a minimal nearest neighbor contour.
points2contour
Tristan Ursell
February 2012

[Xout,Yout]=points2contour(Xin,Yin,P,direction)

Given any list of 2D points (Xin,Yin),...



The user has to supply the fixed ending points before the script can be ran.



The user is presented with the near-optimal solution and performance chart in a dialog window.



The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point.



Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to individual cities and back to the original starting...



This is a small but efficient tool to perform K-nearest neighbor search, which has wide Science and Engineering applications, such as pattern recognition, data mining and signal processing.

The code was initially implemented through...



Simulated Annealing Optimization m-file The program set can be used to solve TRAVELING SALESMAN PROBLEMS
from the TSPLIB.

User Review for Traveling Salesman Problem - Nearest Neighbor Script
- required fields
     

Please enter text on the image