I am working on a dispatch optimization problem in the trucking industry.
I have a first algorithm - a vehicle routing algorithm - that produces a series of tours.
I will need a second algorithm that assigns the tours resulting from the first algorithm to individual drivers, tractors and trailers (i.e. three different kinds of resources). I believe that the second algorithm would need to be (essentially) an assignment problem algorithm.
Here are my questions
- What is the name for the kind of assignment problem where more than one different kind or class of resource needs to be assigned to tasks?
- I believe that one approach to the design of the assignment problem would be to have a binary decision variable for each task / resource / hour-of-the-day combination. I'm thinking this approach is going to be computationally expensive. Are there alternative approaches to this part of the design that might be less computationally expensive?