Code Directory
 Visual Basic & VB.NET
New Code
C# QR Code Generator
Salesforce WordPress Customer Portal 3.2.0
Single Leg MLM 1.2.1
OzGIS 14.6
Quick Maps For Dynamics CRM 3.1
Job Board Software 4.2
PHP Real Estate Script 1.3.2
IP2Location Geolocation Database April.2019
dbForge Data Generator for Oracle 2.1
VisualNEO Web 2018.12.15
SentiMask SDK Trial 1.0.0
OrgChart JS 4.6.4
dotConnect for BigCommerce 1.8
FedEx Smart Shipping For Magento 1.0.0
Database Workbench Pro
Top Code
MATLAB Support Package for Arduino (aka ArduinoIO Package) 1.0
Modbus RS232 ASCII Communication Functions 1.0
CardCheck COM DLL for Credit Card Processing 1.1
Efficient K-Means Clustering using JIT 1.0
webmoney - Webmoney payment gateway 5.x-1.2
Azizi search engine script PHP 4.1.10
Cuckoo Search (CS) Algorithm 1.0
Hyperion Tools 1.0
bit plane slicing 1.0
PasDos 1.0
Another PHP Counter 1.0
JavaScript Webix DataView 1.7
mCore Pro - SMS & WAP Push Component 1.VI
vNews 1.II
Strx Simple Sharing Sidebar Widget 2.0.2
Top Rated
VisualNEO Web 2018.12.15
Paste phpSoftPro 1.4.1
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
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
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: 468
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

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: 468

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