Free traveling script

Open Traveling Salesman Problem - Genetic Algorithm is created to be a useful MATLAB function which finds a near-optimal solution to a "open" variation of the Traveling Salesman Problem using a Genetic Algorithm.

Open Multiple Traveling Salesmen Problem - Genetic Algorithm is considered as a useful MATLAB script that will help you find a near-optimal solution to a "open" variation of the Multiple Traveling Salesman Problem using a genetic algorithm .

Fixed Start Open Traveling Salesman Problem - Genetic Algorithm is designed to be a useful MATLAB function that finds a near-optimal solution to a "open" variation of the Traveling Salesman Problem with fixed start points using a genetic algorithm.

Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm is considered as a very useful MATLAB script that finds a near-optimal solution to a variation of the Multiple Traveling Salesman Problem with fixed endpoints using a genetic algorithm.

Also There are graphs drawn showing the last 24 hours of the following:

1. The "Traffic Index" is a score from 0 to 100 where 0 is "slow" and 100 is "fast". It is determined by comparing the current response of a ping echo to all previous responses from the same router over the past 7 days. A score of 0 to 100 is then assigned to the current response depending on if this response is better or worse than all previous responses from that router.
2. Response Time in reference to Internet traffic is how long it takes for a chunk of data to travel from point A to point B and back (round trip). A typical response time on the Internet is 200 ms, which is 200 milliseconds (thousandths of a second) = 1/5th of one second.