Introduction - If you have any usage issues, please Google them yourself
his is the classic traveling salesman problem. A traveling salesman has to
visit 19 cities in any order. Each city has a profit to be earned by moving
from a city to a different city. Each movement has a different payoff.