Tsp

MAX-MIN Ant System was supposed to work better than AS and ACS.In this M-file, MMAS Algorithm is implemented, it can be easily used as following command to see the playing iterative course.ACO('filename.tsp');here filename.tsp is the problem file of the Symmetrical or Asymmetrical TSP problem... Platforms: Matlab

This demonstration shows the single steps of nearest neighbour, hungarian method (munkres algorithm) for assignment problem, branch and bound for symetric cost matrices. The tree of the branch and bound algorithm is shown and the user can select more or less details. With the file 4 examples are... Platforms: Matlab

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

Several Matlab files intended to compute:1/ the probability that a specified wireless station wins the contention,2/ the probability that collision occurs,according to Enhanced Distributed Coordination Access (EDCA) established in IEEE 802.11e standard.The algorithms used are described in the... Platforms: Matlab

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

The function is based on the paper by Held and Karp from 1962. The DP is guaranteed to provide the accurate (optimal) result to the TSP, but the time complexity of this algorithm is O(2^n n^2), which limits the use of this algorithm to 15 cities or less.NOTE: For reasonable runtime, please do not... 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: Matlab

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

JTime Manager is a java based desktop application designed to keep the time count for any activity, it's a great tool for developers who need to have a time record for example those who has to work under PSP/TSP or CMMI process Platforms: Mac

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