Weight Optimization Challenge / Distribution Problem

[martin68]

I encountered a seemingly simple probelm, that turned out to be a very complex one.

The challenge is to pack as many different items to as few packing boxes as possible,

provided that each packing box total weight do not surpass 2000gr. For Example:

                  (=> REQUIRED OUTPUT TABLE)

This problem is similar to First-fit-decreasing (FFD) algorithm for bin packing.

https://en.wikipedia.org/wiki/First-fit-decreasing_bin_packing

Essentially, this means having all weights in ascending order (see attached workflow)

than sum up the weights along 'weight line' until 2000 is reached, than repeat for the process

for the rest of the weights, until completed (couldn't implement this using Alteryx) , like so:

A solution to this problem using Alteryx could have many usages!

Any help would be much appreciated!

Thank you.

[AlteryxAlexB]

Hi Martin, 

I've responded to this question here https://community.alteryx.com/t5/Alteryx-Designer-Discussions/Weight-Optimization-Packing-Solution/m...

Let me know if it answers your question 😊