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
Database Workbench Pro 5.4.6
Extensibility Studio 3.0
Bytescout Spreadsheet SDK 3.0.0.1699
Magento 2 Admin Mobile App 1.0
Data Compare for MySQL 5.3
ODBC Driver for Zoho CRM 1.3
ODBC Driver for SugarCRM 1.3
Bytescout PDF To HTML SDK 9.0.0.3079
Azizi search engine script PHP 4.1.10
TaxiSoftr - Taxi Booking & Dispatch Software 1.0
VisualNEO for Windows 18.08.31
AnyMap JS Maps 8.4.0
ODBC Driver for MailChimp 1.3
OrgChart JS 3.0.7
AnyStock Stock and Financial JS Charts 8.4.0
Top Code
MATLAB Support Package for Arduino (aka ArduinoIO Package) 1.0
Database Workbench Pro 5.4.6
Stepping stone algorithum for solving the transhipment problem
LMS Algorithm Demonstration 1.0
Cuckoo Search (CS) Algorithm 1.0
Online Food Ordeing System 1.0
Blind detection of the number of sources with a predicted eigenvalue approach 1.0
Real Time Battle 1.1
A Shooting Game 1.1
Genetic Algorithm for n-queen problem 1.0
Detect circles with various radii in grayscale image via Hough Transform 1.0
Issue Manager App 1.0
Hough Transform for circle detection 1.0
Trading Software 1.2.4
Kalman Filter Tutorial 1.0
Top Rated
Output Messenger 1.8.0
Aliexpress Clone- Ec21 Script 1
Indiegogo Clone 3.0
Advanced MLM Software 1.2
Online Food Ordeing System 1.0
PHP Image Resize Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
PHP Point of sale 10.0
Travel Portal Script 9.29
Excel Add-in for Bigcommerce 1.6
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Traveling Salesman Problem (TSP) using Simulated Annealing 1.0
File ID: 78472






Traveling Salesman Problem (TSP) using Simulated Annealing 1.0
Download Traveling Salesman Problem (TSP) using Simulated Annealing 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 512.0 KB
Downloads: 452
Submit Rating:
Traveling Salesman Problem (TSP) using Simulated Annealing 1.0 Description
Description: 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 your own data set by following a simple procedure given in the supporting document.

You can access the TSPLIB by following this link
http://www.iwr.uni-heidelberg.de/groups/co...tware/TSPLIB95/

Feel free to drop in your comments, suggestions, bugs and mistakes in the algorithm.

Note: Simulated Annealing is a memory intensive and processor intensive algorithm. A big data set may take hours depending on your computer configuration.

License: Freeware

Related: Comments, suggestions, mistakes, Access, documentyou, Simple, Procedure, Supporting, algorithmnote, simulated, hours, depending, Computer, Configuration, Algorithm, Processor, annealing, Memory

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

File Size: 512.0 KB

Downloads: 452



More Similar Code

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 selected.



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



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



Two programs are attached: sa_demo demonstrates how the simualted annealing works for simple functions, while sa_mincon solves a welded beam design problem using simulated annealing, which can easily be used to solve other constrained optimization...



Solution for the Travelling Salesman Problem using genetic algorithm. Speed, particularly at large data volumes, is of essence. The project uses advanced variants of cross-over and mutation algorithms in order to expedite search in the solution...



Drools Planner does automated planning. It solves a planning problem while respecting the constraints as much as possible. It implements tabu search, simulated annealing and more.

Use cases:
Bin packaging
Employee shift...



anneal Minimizes a function with the method of simulated annealing (Kirkpatrick et al., 1983)

ANNEAL takes three input parameters, in this order:

LOSS is a function handle (anonymous function or inline) with a loss function,...



Simulated annealing is an optimization algorithm that skips local minimun. It uses a variation of Metropolis algorithm to perform the search of the minimun. It is recomendable to use it before another minimun search algorithm to track the global...



Adaptive Simulated Annealing (ASA) is a C-language code that finds the best global fit of a nonlinear cost-function over a D-dimensional space. ASA has over 100 OPTIONS to provide robust tuning over many classes of nonlinear stochastic systems.



Munkres algorithm (also known as Hungarian algorithm) is an efficient algorithm to solve the assignment problem in polynomial-time. The algorithm has many applications in combinatorial optimization, for example in Traveling Salesman problem.

User Review for Traveling Salesman Problem (TSP) using Simulated Annealing
- required fields
     

Please enter text on the image