Shortest Path Problem: Pickup All Deliveries within time constraint with least pickup drivers

Question

I want to know what would be the best/state of art algorithm to solve below problem:

We have a list of 1000 deliveries (ID, [Lat,Long]).. which needs to be picked usi