Optimization problem over bidirectional connected graph A company has several automatic vertical warehouses (called elevators). Each elevator have several trays and each tray has several slots. A slot contains a given quantity of a given article. Elevators, trays and slots are identified by unique IDs and slot also have access to the ID of their own article. In the same tray there can be multiple slots with the same article.
Example:
tray A contains

slot SA1 with 5 items of article X;
slot SA2 with 10 items of article Y;
slot SA3 with 3 items of article Z

tray B contains

slot SB1 with 12 items of article Y

tray C contains

slot SC1 with 4 items of article X;
slot SC2 with 15 items of article Z;
slot SC3 with 8 items of article W

trays A, B and C belong to the same elevator.
——————————————————
I have to design an algorithm which, given an order list (we can model it as a dictionary with articles' IDs as key and quantity needed as values), returns the minimum list of trays needed to satisfy the order. That is, find the smallest (in terms of cardinality) set of tray whom slots contain a sufficient quantity of each articles listed in the order.
This is quite different from a standard warehouse optimization problem because we are not considering the physical distances between each tray, since the elevators are automatic and they give us the tray, while in the classical problem is the human who moves toward the tray to pick the item from it.
After reading through articles about warehouse optimization, I've decided to take an heuristic approach.
I've modeled a sort of euclidean space, with an axes for each article contained in the order. Then we can consider a tray as a point on that space, with coordinates for each axes equal to the quantity that tray has of the article corresponding to that axes. In the same way we can imagine our order as a point.
Then I've create a heuristic function, $f(order\ o, tray\ t)$, which returns the &quot;euclidean distance&quot; from point-tray $t$ to the point-order $o$. The idea is that the more a tray is &quot;near&quot; the order, the more article we can pick out of it.
So, to satisfy the order, I simply compute $f(order\ o, tray\ t)$ for each tray in every elevator. Then I order it by descending value and finally I greedily take a tray with the minimum distance from the order. This will be repeated until we collect enough articles to satisfy the order.
I've tried to build a graph in which each node is a tray and is connected to each of the others by a directed edge. The weights of the edge from node $i$ to node $j$ will be equal to the heuristic function computed on tray $j$.
→ $w[i, j] = f(order, j)$
This results in a fully-connected, bidirectional graph (each node linked with each other node by both an incoming and an outgoing edge).
I want to apply some algorithm of shortest path (or any other useful algorithm) taken from graph theory on this graph but I couldn't find anything really helpful.
Is there any algorithm I can apply on such a graph? Or maybe the graph is not the right structure to represent my problem. I'm open to new solutions.
This is the special case of the multidimensional knapsack problem where each item (tray) has the same value (consider the set of trays you don't select).  It presumably remains NP-hard, but can be solved by a number of methods.  Probably the easiest to try first is to formulate this as an instance of integer linear programming and then apply an ILP solver to it.