Travelling Salesman Problem Php

An application testing the different solutions for the travelling salesman problem

DKRouteFinder is a free Cocoa class that offers a practical solution to the Travelling Salesman Problem - efficiently finding an optimal route among a set of arbitrarily distributed objects.

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


Platforms: Matlab

The Simulated Annealing Method for the Traveling Salesman Model demonstrates the use of the "simulated annealing algorithm" to attempt to solve the "travelling salesman" problem. A text file containing longitude and latitude data for 120 cities in the US and southern Canada is loaded when this...


Platforms: Mac

The 2-column vector contains cities' coordinates. The algorithm generates the optimal path to visit all the cities exactly once, and return to the starting city.The algorithm has its limitations, and based on the cities' distribution on the map it may or may not give the optimal solution.It...


Platforms: Matlab

JOpt.SDK is spatial route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum...


Platforms: Java

http://simulations.narod.ru/There is a set of cities (points) in 2d plane. Each city has road to each city. We need to find loop-path that will be in each city only one time and path length is minimal. There are lot of paths with different lengths. A path can have crossover with another path and...


Platforms: Matlab

The user has to supply the fixed ending points before the script can be ran. Requirements: - MATLAB 7.6 or higher


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point. Requirements: - MATLAB 7.6 or higher


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

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


Platforms: Matlab

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


Platforms: Matlab

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


Platforms: Matlab

JOpt.NET TourPlanner is an automated shipment planning and dispatching .NET component for logistic applications that can solve Travelling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRP,VRPTW). JOpt.NET offers route and transport optimisation with respect...


Platforms: Windows

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


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

Currently, it implements Ant Colony Optimization (ACO) and Consultant-Guided Search (CGS) algorithms. The following ACO algorithms are supported: Ant System (AS), Ant Colony System (ACS), MAX-MIN Ant System (MMAS), Elitist Ant System (EAS), Rank-Based Ant System (RAS) and Best-Worst Ant System...


Platforms: Mac

Algorithm::TravelingSalesman::BitonicTour is a Perl module to solve the euclidean traveling-salesman problem with bitonic tours. SYNOPSIS use Algorithm::TravelingSalesman::BitonicTour; my $bt = Algorithm::TravelingSalesman::BitonicTour->new; $bt->add_point($x1,$y1); $bt->add_point($x2,$y2);...


Platforms: *nix

"Hungarian algorithm" to solve the square assignment problem (original & pure MATLAB implementation). The Hungarian algorithm can also be used as a sub-solver in a B&B solver for the travelling salesman problem.How to match N (e.g. N=6) pairs of signals from 2 experiments? Build full reordering...


Platforms: Matlab

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.


Platforms: Matlab

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.


Platforms: Matlab

JOpt.SDK is a tour optimization JAVA library that uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour. You may...


Platforms: *nix