Travelling Salesman Problem Php

An application testing the different solutions for the travelling salesman problem Platforms: Windows, Mac, Linux

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. Platforms: Mac

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

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

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

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

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

Open BEAGLE is a C Evolutionary Computation (EC) framework. It provides an high-level software environment to do any kind of EC, with support for tree-based genetic programming; bit string, integer-valued vector, and real-valued vector genetic algorithms; and evolution strategy.The Open BEAGLE... Platforms: Windows, Mac, *nix, C/C++, BSD Solaris

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 place).Each salesman starts at the first point, and... Platforms: Matlab

Finds a (near) optimal solution to a variation of the "open" 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 unique individual cities without returning to the starting location).Each salesman starts at the... Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

The script finds a (near) optimal solution to a variation of the "open" 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 unique individual cities and finally to the end location).Each salesman starts at the... Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

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 place).Each salesman starts at the first point, and... Platforms: Windows, Mac, *nix, Matlab, BSD Solaris