new heuristic for three dimensional strip packing problem

28
NEW HEURISTIC FOR THREE DIMENSIONAL STRIP PACKING PROBLEM Ha Thai Duong Supervisor: Edmund Burke, Graham Kendall

Upload: halima

Post on 23-Feb-2016

31 views

Category:

Documents


0 download

DESCRIPTION

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 - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: New Heuristic for Three Dimensional Strip Packing Problem

NEW HEURISTIC FOR THREE DIMENSIONAL STRIP PACKING PROBLEMHa Thai Duong Supervisor: Edmund Burke, Graham Kendall

Page 2: New Heuristic for Three Dimensional Strip Packing Problem

Overview Problem Definition Literature Review Currently Used Heuristic Tested Result Conclusion

Page 3: New Heuristic for Three Dimensional Strip Packing Problem

Problem Definition Pack all boxes into a smallest open

container Min (Optimal Volume/Actual Volume)

Open Container

Boxes

Page 4: New Heuristic for Three Dimensional Strip Packing Problem

Problem Definition Logistic

Container Storage

Cutting Material Space allocation

Page 5: New Heuristic for Three Dimensional Strip Packing Problem

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

Page 6: New Heuristic for Three Dimensional Strip Packing Problem

Literature Review Exact method

Dudzinski, K. and Walukiewicz, S., 1987 Heuristic

Heuristic Heuristic & Search Method

Page 7: New Heuristic for Three Dimensional Strip Packing Problem

Literature Review Layer Building

Moura and Oliveira, 2005 A. Bortfeldt and D. Mack 2007

Page 8: New Heuristic for Three Dimensional Strip Packing Problem

Literature Review Box Arrangement

Bortfeldt and Gehring, 1998 Eley 2002 Bortfeldt et al., 2003

Page 9: New Heuristic for Three Dimensional Strip Packing Problem

Literature Review Best Fit

E. K. Burke, G. Kendall, and G. Whitwell. 2004 S. Allen E. K. Burke G. Kendall

And manymore ...

GAP

Page 10: New Heuristic for Three Dimensional Strip Packing Problem

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. ....

Page 11: New Heuristic for Three Dimensional Strip Packing Problem

Literature Review Each heuristic suitable for some cases Constructive heuristic is more important

than search method Addition Constraints:

Orientation constraint Weight distribution Loading stability

Page 12: New Heuristic for Three Dimensional Strip Packing Problem

Currently Used Heuristic Max Surround Touching Min Rotation Score Min Volume Percentage Max Contact Area & Max Volume (S.

Allen E. K. Burke G. Kendall)

Page 13: New Heuristic for Three Dimensional Strip Packing Problem

Max Surround Touching Touching top of the box

Page 14: New Heuristic for Three Dimensional Strip Packing Problem

Max Surround Touching

Page 15: New Heuristic for Three Dimensional Strip Packing Problem

Max Surround Touching Touching top of the box

Page 16: New Heuristic for Three Dimensional Strip Packing Problem

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

Page 17: New Heuristic for Three Dimensional Strip Packing Problem

Min Rotation Score

No Rotation

Page 18: New Heuristic for Three Dimensional Strip Packing Problem

Min Rotation Score

No Rotation

Page 19: New Heuristic for Three Dimensional Strip Packing Problem

Min Rotation Score

No Rotation

Page 20: New Heuristic for Three Dimensional Strip Packing Problem

Min Rotation Score

No Rotation

Page 21: New Heuristic for Three Dimensional Strip Packing Problem

Min Rotation Score

No Rotation

Page 22: New Heuristic for Three Dimensional Strip Packing Problem

Min Volume Percentage Optimal Volume/ Actual Volume

Page 23: New Heuristic for Three Dimensional Strip Packing Problem

Min Volume Percentage

Page 24: New Heuristic for Three Dimensional Strip Packing Problem

Min Volume Percentage

Page 25: New Heuristic for Three Dimensional Strip Packing Problem

Tested Result BR dataset – OR Library

BR10 – 87.2% (Best 87.6)

Viewer created by Sam Allen

Page 26: New Heuristic for Three Dimensional Strip Packing Problem

Conclusion & Future Work New heuristic particular good in some

cases Multiple heuristic run Different data set Application hyper-heuristic

Page 27: New Heuristic for Three Dimensional Strip Packing Problem

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

Page 28: New Heuristic for Three Dimensional Strip Packing Problem

Thank you

Questions