Re: SQL Question

On Thu, Sep 8, 2022 at 9:17 AM Greg Wilburn
<gwilburn@xxxxxxxxxxxxxxxxxxxxxxx> wrote:

Thank you all for the responses... Charles hit the nail on the head. This is certainly non-trivial.

It's not "merely" nontrivial. It is a well-known hard problem in
mathematics and computer science. The optimization version (i.e.
what's the most efficient possible packing?) has been proven to be
NP-hard. The decision version (i.e. given a particular container, is
there a way to pack all the widgets into it?) is NP-complete. This
puts it in the same computational class of problem as the perhaps more
famous Traveling Salesperson Problem.

No one has found an efficient perfect solution. Not even Amazon, with
all its resources. There are efficient heuristic algorithms that can
provide "good enough" solutions. (In general, these kinds of
algorithms are not very well suited to programming in SQL.)

Rather than trying to figure out what box the items will fit into (based on their dimensions), I was considering finding an order that matched the contents.

That's an excellent idea. Looking up a past calculation is almost
always easier and faster than doing the calculation from scratch.

So for right now, we're going to rely on the "human" computer (i.e. the picker) to know what box to use.

Humans have *extremely* efficient heuristic algorithms.

John Y.