Vehicle Routing Problem with multiple deliveries? I have a problem that can be reduced to the following:


  There are three types of objects, A, B, and C. For each type of object, there are a number of "pickup points" and a number of "delivery points" (eg. there are five places where you can pick up object A, and five places where you must deliver it). What is the optimal route?


It is similar to the "vehicle routing problem with pickups and deliveries", except that rather than delivering one item from one point to another there are multiple choices for pickup and delivery points.

Is there literature, or perhaps software, that treats this specific problem? Alternatively, can this problem be reduced to a more common variant?
It can be reduced to a TSP with an incomplete graph (i.e. with some missing edges). Each delivery "slot" is simply represented as a node in the graph, connected appropriately to the other nodes.