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.

There are algorithms for vrp.. have you gone through it??

yea...but they are different from the requirements...
normally there is given 1 vehicle and travel all the possible...
but the requirements states that multiple vehicles, e.g 3...
I have tried permutation to find all the possibilities...
but I wonder how to spilt the possibilities into 3 vehicles...

the scenario is something like this ...
vehicle 1 - city 0, 1 , 2, 3, 0
vehicle 2 - city 0, 4 , 5, 6, 0
vehicle 3 - city 0, 7 , 8, 9 ,0

can u please elaborate the problem for me?? i feel it difficult to understand!!!

can u please elaborate the problem for me?? i feel it difficult to understand!!!

The question is like this:

Given a set of locations [e.g. 9] and a set of homogenous vehicles [e.g. 3], 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).

Compute the minimum travel time for all the vehicles to complete the tour of all the cities.

Did u get it?

This article has been dead for over six months. Start a new discussion instead.