4
$\begingroup$

I have concluded there is not, or if there is it's not openly published?

I am trying to identify if there are "top solutions/formulations" for the 3d BPP. Looking to apply in a parcel packing context.

Update: The problem is parcel packing, given a known set of items, their weights and dimensions, and a fixed set of possible boxes(different sizes allowed). I recognize now this is a narrow interpretation. I'm interested in any solution to this problem(it does not necessarily need to be optimizations, or be formulated in 3d, etc.) I'll consolidate any responses/findings I see posted. Thank you!

Improve this question
$\endgroup$

3 Answers 3

Reset to default
6
$\begingroup$

BPPLIB – A Bin Packing Problem Library: http://or.dei.unibo.it/library/bpplib

Improve this answer
$\endgroup$
3
  • 2
    $\begingroup$ You should add this (plus whatever else) as an answer at "Optimization Problem Libraries" or.stackexchange.com/questions/244/… $\endgroup$
    – Mark L. Stone
    Commented Jul 19, 2021 at 14:53
  • 1
    $\begingroup$ Let's note that it's only for 1D BPP $\endgroup$
    – fontanf
    Commented Jul 19, 2021 at 15:57
  • $\begingroup$ BPPLIB contains a lot of instances for Bin Packing and Cutting Stock problems. It also gives an extensive survey of techniques to solve these problems, with links to papers and codes. We use it a lot to benchmark: localsolver.com/benchmarkbpp.html. Nevertheless, as @fontanf pointed out, this is limited to 1D bin packing. $\endgroup$
    – Hexaly
    Commented Jul 20, 2021 at 8:39
2
$\begingroup$

For the 2D and 3D variant you can find multiple instances as well as instance generators here:

Improve this answer
$\endgroup$
0
$\begingroup$

If you're looking for a heuristic check this out. The limitation is that it is written in java.

Improve this answer
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.