Traveling Salesman Heuristics

Methodology:
Using a solver based algorithm we calculate an optimized travel route, designed to shorten the travel distance and as an extension lower costs. Utilizing the "nearest neighbor" heuristic we will determine a cost savings route to travel. Because of the complexity of this problem (Super Computers have difficulty solving this mathematical problem), we have limited the number of cities (nodes) for this problem to 50.
click here
email to: cutcosts@granularityanalytics.com

Price:
$200 first 5 cities (nodes), $100 all after that
Click Below For Example

Output:

Delivers the optimal travel route between multiple destinations.