Hi,

I'm supposed to write a code of finding the shortest path of VRP...

Assume that shortest path = shortest time.

"Given a set of locations and a set of homogenous vehicles, find the minimum time of tour that visits each city exactly once by any of the given vehicle. Write a sequential program to solve the simplified vehicle routing problem (VRP)"

Assume the set of location is 9 and set of vehicles is 3.

BTW, I'm supposed to read the data from a file that gives the cities coordination.

I know that I have to do the permutation to find the possibilities.

Please let me know if some more information is needed.

Thanks a lot.