Help with programming for visual basic

I am creating a program to complete the task of finding the shortest distance for a route that includes 16 locations. I've got the distances from each location to each other location. Now, I need to basically say that given this list (I'll be putting the locations in a formula of location1 + location2 + location3..........+location16 = (here is where I need assistance)) I need the formula to equal the lowest possible number from any combination of the given locations (but it must include all 16 locations). I am not a programmer by trade (as one might be able to tell from the way I'm explaining my need)--non the less, I am required to finish this program. I am at a loss,,,PLEASE HELP

Comments

: I am creating a program to complete the task of finding the shortest : distance for a route that includes 16 locations. I've got the : distances from each location to each other location. Now, I need to : basically say that given this list (I'll be putting the locations in : a formula of location1 + location2 + location3..........+location16 : = (here is where I need assistance)) I need the formula to equal : the lowest possible number from any combination of the given : locations (but it must include all 16 locations). I am not a : programmer by trade (as one might be able to tell from the way I'm : explaining my need)--non the less, I am required to finish this : program. I am at a loss,,,PLEASE HELP: This is a known problem. There are several algorithms to solve this problem. Here are a few: http://en.wikipedia.org/wiki/Shortest_path_problem

: : I am creating a program to complete the task of finding the shortest : : distance for a route that includes 16 locations. I've got the : : distances from each location to each other location. Now, I need to : : basically say that given this list (I'll be putting the locations in : : a formula of location1 + location2 + location3..........+location16 : : = (here is where I need assistance)) I need the formula to equal : : the lowest possible number from any combination of the given : : locations (but it must include all 16 locations). I am not a : : programmer by trade (as one might be able to tell from the way I'm : : explaining my need)--non the less, I am required to finish this : : program. I am at a loss,,,PLEASE HELP: : : This is a known problem. There are several algorithms to solve this : problem. Here are a few: : http://en.wikipedia.org/wiki/Shortest_path_problem