I am working on the problem of routing vehicles with a single depot. The definition of the problem is as follows. There are n vechiles that need to move to the number of sites. Each site has its own specific restrictions, since only vehicles with a certain bandwidth can be served on this site, some sites must be served at a certain time of the day. Also, vehicles will have different capacities and will have different start and end times.
The idea is to minimize travel time for vehicles from the depot.
I am building a cost matrix for the problem. Although I am not an expert in graph theory, I know that I could use the Hamiltonian cycle to solve the problem if it got into the classic problem with Traveling Salesman. However, since it gets into the problem with several salespeople, I want to know how I can solve the problem using Hamiltonian cycles, or if there is another process specifically designed to solve the problems as such?
Any help would be greatly appreciated.
source
share