Support other problem variants

[rujialiu]

Dear sir,

First of all, thanks for the awesome library. May I ask whether you're planning to implement more problem types? jagua-rs supports bin packing, and while my main use-case is bin packing (and optimize the last bin's leftover), Also I occasionally need to solve (multi-)knapsacking and variable-sized bin packing. I would be great if you're planning at least bin packing.

Yours,
Rujia Liu

[JeroenGar]

Hi Rujia,

Thanks for your interest and the kind words!
jagua-rs can indeed easily support all the variants you're describing (and much more).

I do plan to adapt sparrow to handle bin packing, knapsack and leather-nesting problems (heterogeneous & irregular bins).
However, as of now, I am focussing on finishing up the academic paper for this strip packing algorithm and making sure its implementation (sparrow) is as elegant and performant as possible.

Once this is over, I will adapt it to other variants. I already have a pretty good idea how to tackle it.

PS: If you have any instances (shapes) for me to test with, please send them to me.
Finding good benchmark instances is hard for irregular cutting & packing problems.

Best,
Jeroen

[rujialiu]

Thanks for your quick response! I have a couple of real-world instances but I don't intend to make them public for now (probably later). So could you send an email to my address rujia.liu@qq.com so that I can reply?

[jtommy]

@JeroenGar any news about it? Anyway great job!

[JeroenGar]

Hi @jtommy, (and @rujialiu)

Thanks for the kind words!

I recently developed a adaptation of sparrow that supports bin-packing (and minimizes the width of the last strip).
From an algorithmic sense it is completely equivalent to sparrow.

This version will remain closed source, though, with perpetual licenses of the codebase available.
If you are interested, shoot me a message via LinkedIn or email.

Jeroen