🔒 Locked

3D Packing algorithm

Started by etran1 Aug 13, 2001 at 4:12 PM 0 replies 550+ views

Original Post

Aug 13, 2001 at 4:12 PM

I''m writing a web application which needs to calculate shipping costs based on the size of a package. This package contains smaller packages for individual products. I need an algorithm that will give me the best way to pack them while taking up the least amount of space. Any suggestions, recommendations would be helpful and appreciated. It would even be better if there was also some source code. Thanks Eric

JonStelly

Aug 13, 2001 at 6:58 PM

I haven''t ever tried to write this out as an algorithm, but I would attack it by taking the dimensions of the largest item and use it for a base point for the package. Then go from there, adding items to the package in order from largest -> smallest, and trying not to grow the package by staying inside your current dimensions.

By the time you get to the smaller items, they have a higher chance of filling in ''filler-space'' than if you went from a small items -> large item method.

Topic Locked

This topic has been locked by a moderator. New replies are not allowed.