1 / 28

New Heuristic for Three Dimensional Strip Packing Problem

New Heuristic for Three Dimensional Strip Packing Problem. Ha Thai Duong Supervisor: Edmund Burke, Graham Kendall. Overview. Problem Definition Literature Review Currently Used Heuristic Tested Result Conclusion . Problem Definition. Pack all boxes into a smallest open container

halima
Download Presentation

New Heuristic for Three Dimensional Strip Packing Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. New Heuristic for Three Dimensional Strip Packing Problem Ha Thai Duong Supervisor: Edmund Burke, Graham Kendall

  2. Overview • Problem Definition • Literature Review • Currently Used Heuristic • Tested Result • Conclusion

  3. Problem Definition • Pack all boxes into a smallest open container • Min (Optimal Volume/Actual Volume) Boxes Open Container

  4. Problem Definition • Logistic • Container • Storage • Cutting Material • Space allocation

  5. Problem Definition • Dyckhoff (1990) • 3/B/O/F, 3/B/O/M or 3/B/O/R • 3: three-dimensional, B/O: one object/container and selection of items, F: few items of different types, M: many items of many different types, R: many items of relatively few different types). • Wascher et al. (2007) • Three-dimensional cuboids open-dimension-problem

  6. Literature Review • Exact method • Dudzinski, K. and Walukiewicz, S., 1987 • Heuristic • Heuristic • Heuristic & Search Method

  7. Literature Review • Layer Building • Moura and Oliveira, 2005 • A. Bortfeldt and D. Mack 2007

  8. Literature Review • Box Arrangement • Bortfeldt and Gehring, 1998 • Eley2002 • Bortfeldt et al., 2003

  9. Literature Review • Best Fit • E. K. Burke, G. Kendall, and G. Whitwell. 2004 • S. Allen E. K. Burke G. Kendall • And manymore ... GAP

  10. Literature Review • Heuristic & Search Method • Tabu Search • T.G. Crainic, G. Perboli and R. Tadei 2009 • E.E. Zachariadis, C.D. Tarantilis and C.T. Kiranoudis 2009 • Genetic Algorithms • Gehring, H., Bortfeldt, A., 2002. • ....

  11. Literature Review • Each heuristic suitable for some cases • Constructive heuristic is more important than search method • Addition Constraints: • Orientation constraint • Weight distribution • Loading stability

  12. Currently Used Heuristic • Max Surround Touching • Min Rotation Score • Min Volume Percentage • Max Contact Area & Max Volume (S. Allen E. K. Burke G. Kendall)

  13. Max Surround Touching • Touching top of the box

  14. Max Surround Touching

  15. Max Surround Touching • Touching top of the box

  16. Min Rotation Score • Box with less rotation is harder to pack • Packing box with min rotation score • Rotation Score • (Number Possible Rotation * Number Box)/ Total Number Box

  17. Min Rotation Score No Rotation

  18. Min Rotation Score No Rotation

  19. Min Rotation Score No Rotation

  20. Min Rotation Score No Rotation

  21. Min Rotation Score No Rotation

  22. Min Volume Percentage • Optimal Volume/ Actual Volume

  23. Min Volume Percentage

  24. Min Volume Percentage

  25. Tested Result • BR dataset – OR Library • BR10 – 87.2% (Best 87.6) Viewer created by Sam Allen

  26. Conclusion & Future Work • New heuristic particular good in some cases • Multiple heuristic run • Different data set • Application hyper-heuristic

  27. References • A New Hybrid Placement Strategy for the Three-Dimensional Strip Packing Problem (S. Allen E. K. Burke G. Kendall) • An improved typology of cutting and packing problems Gerhard Wa¨scher *, Heike Hausner, Holger Schumann • A heuristic for the three-dimensional strip packing problem, Andreas Bortfeldt, Daniel Mack

  28. Thank you Questions

More Related