|
|||||||||
|
|||||||||
| |||||||||
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
Dev Shed Forums Sponsor:
|
|
|
|
#1
January 1st, 2003, 04:53 AM
|
|||
|
|||
|
3d bin packing
This is something thats been giving me headaches trying to figure out.
Say you have a set of any number of boxes of any size and a second set of boxes of any size. How could you find the smallest box from set two that you could fit all the boxes from set one into? This is for a shipping application. Can any of you figure this out? I've had trouble sleeping trying to figure it out. Google has only taught me that this type of problem is called three dimensional bin packing. I havn't been able to find anything useful. Thanks for any help or suggestions. PHP code a big plus. Last edited by KilerCris : January 1st, 2003 at 04:56 AM.
|
|
#2
January 3rd, 2003, 08:08 PM
|
||||
|
||||
|
Some random items that might help...
An algorithm in C: http://www.diku.dk/~pisinger/3dbpp.c Code and research papers: http://www.or.deis.unibo.it/researc...des/TSpack.html Paper discussing the problem with code examples: http://archive.cs.uu.nl/pub/RUU/CS/...996/1996-39.pdf US Air Force paper with flow chart, diagrams and an algorithm: http://www.au.af.mil/au/database/pr...-ens-01m-02.pdf
|
|
| Viewing: Dev Shed Forums > Programming Languages - More > Software Design > 3d bin packing |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
