Corpus ID: 10130661

OPTIMIZING THREE-DIMENSIONAL BIN PACKING THROUGH SIMULATION

@inproceedings{Dube2006OPTIMIZINGTB,
  title={OPTIMIZING THREE-DIMENSIONAL BIN PACKING THROUGH SIMULATION},
  author={E. Dube},
  year={2006}
}
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into a minimum number of three-dimensional rectangular bins. We harness the computing power of the modern day computers to solve this NP-Hard problem that would be otherwise practically extremely difficult. The software tool that we develop using both heuristics and some knapsack problem approach, presents the solutions as a 3D graphical representation of the solution space. The visual… Expand

Figures and Tables from this paper

References

SHOWING 1-7 OF 7 REFERENCES
The Three-Dimensional Bin Packing Problem
  • 480
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems
  • 94
  • PDF
Ant Colony Optimisation for Bin Packing and Cutting Stock Problems
  • 32
  • PDF
A hybrid grouping genetic algorithm for bin packing
  • 549
  • Highly Influential
  • PDF
Cutting Optimization with Store Utilization, International design conference – DESIGN, Dubrovnik
  • 2000
learning to combine simple heuristics in bin - packing problem
  • Discrete Applied mathematics ACM
  • 2000