that sounds like a fun travelling salesman problem with more moving parts. What is the best route for this drone platform truck, taking into account how efficient it is for each drone to make its delivery, and how the truck’s position will have changed in the time it takes for the drone to return.
That is actually a problem under research; there are a few papers on it and luckily they use the obvious name — TSP with drones or TSP-D.
I gave that problem a very shallow go for a Metaheuristics assignment, and while I didn't really mess with the domain specific heuristics for it, it did seem pretty fun indeed.
