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
phpEnter 5.1.
Udemy Clone script 2.01
VisualNEO Web 19.11.7
VisualNEO for Windows 19.4.29.0
SentiVeillance SDK Trial 7.3
Devart ODBC Driver for PostgreSQL 3.2
SecureBridge 9.2
dotConnect for QuickBooks 1.9
dotConnect for Magento 1.9
dotConnect for Zoho CRM 1.10
dotConnect for FreshBooks 1.10
IP2Location Geolocation Database January.2020
dotConnect for BigCommerce 1.10
HTMLPad 2020 16.0
WeBuilder 2020 16.0
Top Code
SecureBridge 8.0
IP2Location Geolocation Database January.2020
ATN Site Builder 3.0
RADAR simulation 1.0
ATN Resume Finder 2.0
Huffman Coding and Arithmetic Coding 1.1
ADO.NET Provider for ExactTarget 1.0
Huffman Coding_Decoding 1.0
b64 -- Base64 Encode/Decode Utility 1.0
phpEnter 5.1.
Simple reverse converter of unicode code points string
Perl Black Book, 2nd Edition
PHP Review Script 1.0
Change Background Color
Progressive Switching Median Filter 1.0
Top Rated
phpEnter 5.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
ADO.NET Provider for ExactTarget 1.0
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