Formulate the problem as a traveling sales man problem, it's a 0-1 binary programming problem, can be solved by many algorithms such Genetic Algorithms, Simulated Annealing Algorithms