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

Slides:

Advertisements

Similar presentations

Associative Classification (AC) Mining for A Personnel Scheduling Problem Fadi Thabtah.

Advertisements

Ch2 Data Preprocessing part3 Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2009.

Chapter 6: Memory Management

Michele Samorani Manuel Laguna. PROBLEM : In meta-heuristic methods that are based on neighborhood search, whenever a local optimum is encountered, the.

Novembro 2003 Tabu search heuristic for partition coloring1/29 XXXV SBPO XXXV SBPO Natal, 4-7 de novembro de 2003 A Tabu Search Heuristic for Partition.

Winner trees. Loser Trees.

Ant Colony Hyper-heuristics for Graph Colouring Nam Pham ASAP Group, Computer Science School University of Nottingham.

Two-dimensional Automated Planograms Ruibin Bai 1, Tom van Woensel 2, Graham Kendall 1, Edmund K. Burke 1 1.ASAP Research Group, School of Computer Science.

ICT 1 A heuristic for maritime inventory routing Oddvar Kloster, Truls Flatberg Molde,

Utilizing Problem Structure in Local Search: The Planning Benchmarks as a Case Study Jőrg Hoffmann Alberts-Ludwigs-University Freiburg.

2D/3D Packing based on LFF (Less Flexibility First) principle.

Simulated Evolution Algorithm for Multi- Objective VLSI Netlist Bi-Partitioning Sadiq M. Sait, Aiman El-Maleh, Raslan Al-Abaji King Fahd University of.

FEUP | PDEEC | Decision Support January 3 rd, 2011 Metaheuristics: GRASP Group 1: Clara Gouveia Daniel Oliveira Fabrício Sperandio Filipe Sousa [Presenter]

R Bai, EK Burke and G Kendall Speaker: Ufo

A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.

AT&T Labs1 The Sensor Cover Problem Alon Efrat (U. Arizona) Adam Buchsbaum (AT&T Labs) Shaili Jain (Harvard) Suresh Venkatasubramanian (AT&T Labs) Ke Yi.

Fast Force-Directed/Simulated Evolution Hybrid for Multiobjective VLSI Cell Placement Junaid Asim Khan Dept. of Elect. & Comp. Engineering, The University.

Structure and Phase Transition Phenomena in the VTC Problem C. P. Gomes, H. Kautz, B. Selman R. Bejar, and I. Vetsikas IISI Cornell University University.

Attack-Resistant Networks Allen G. Taylor Communication networks have four primary objectives: Minimize.

A tale of 2-dimensional (Guillotine) bin packing Nikhil Bansal (IBM) Andrea Lodi (Univ. of Bologna, Italy) Maxim Sviridenko (IBM)

Jeff Howbert Introduction to Machine Learning Winter Machine Learning Feature Creation and Selection.

Tag-Cloud Drawing: Algorithm for Cloud Visualization

 Optimal Packing of High- Precision Rectangles By Eric Huang & Richard E. Korf 25 th AAAI Conference, 2011 Florida Institute of Technology CSE 5694 Robotics.

Nelishia Pillay School of Mathematics, Statistics and Computer Science University of KwZulu-Natal

A Constraint Programming Approach to Solving a Ship Loading Problem Andreas Jordan Professor Markus Stumptner.

A Multi-Start Approach for Optimizing Routing Networks with Vehicle Loading Constraints Angel Juan Oscar Domínguez Department.

1 SD-Rtree: A Scalable Distributed Rtree Witold Litwin & Cédric du Mouza & Philippe Rigaux.

A Tree Search Algorithm for Solving the Two-Dimensional Knapsack Problem T. Fanslau and A. Bortfeldt University in Hagen, Germany Contents: 1Introduction.

Protein Folding in the 2D HP Model Alexandros Skaliotis – King’s College London Joint work with: Andreas Albrecht (University of Hertfordshire) Kathleen.

Topical Crawlers for Building Digital Library Collections Presenter: Qiaozhu Mei.

An Efficient Placement Strategy for Metaheuristics based Layout Optimization by Abdul-Rahim Ahmad Otman Basir Systems Design Engineering, University of.

An Efficient Clustering Algorithm For Low Power Clock Tree Synthesis Rupesh S. Shelar Enterprise Microprocessor Group Intel Corporation, Hillsboro, OR.

PSO and its variants Swarm Intelligence Group Peking University.

Packing Rectangles into Bins Nikhil Bansal (CMU) Joint with Maxim Sviridenko (IBM)

ASC2003 (July 15,2003)1 Uniformly Distributed Sampling: An Exact Algorithm for GA’s Initial Population in A Tree Graph H. S.

Modern VLSI Design 2e: Chapter 7 Copyright  1998 Prentice Hall PTR Topics n Block placement. n Global routing. n Switchbox routing.

A Hybrid Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows Michel Toulouse 1,2 Teodor Gabriel Crainic 2 Phuong Nguyen 2 1 Oklahoma.

0 Weight Annealing Heuristics for Solving Bin Packing Problems Kok-Hua Loh University of Maryland Bruce Golden University of Maryland Edward Wasil American.

Hyper-heuristics. 2 Outline Hyper-heuristics Hyper-heuristics for strip packing Hyper-heuristics for Stock forecasting Conclusion.

Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh University of Maryland Bruce Golden University.

Asanka Herath Buddhika Kottahachchi

T. Messelis, S. Haspeslagh, P. De Causmaecker B. Bilgin, G. Vanden Berghe.

A Hyper-heuristic for scheduling independent jobs in Computational Grids Author: Juan Antonio Gonzalez Sanchez Coauthors: Maria Serna and Fatos Xhafa.

1 Solving the Open Vehicle Routing Problem: New Heuristic and Test Problems Feiyue Li Bruce Golden Edward Wasil INFORMS San Francisco November 2005.

The bin packing problem. For n objects with sizes s 1, …, s n where 0 < s i ≤1, find the smallest number of bins with capacity one, such that n objects.

Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.

A Two-Phase Linear programming Approach for Redundancy Problems by Yi-Chih HSIEH Department of Industrial Management National Huwei Institute of Technology.

Biologically Inspired Computing: Indirect Encodings, and Hyperheuristics This is DWC’s lecture 7 for `Biologically Inspired Computing’ Contents: direct.

THREE DIMENSIONAL-PALLET LOADING PROBLEM BY ABDULRHMAN AL-OTAIBI.

Stackabilization Honghua Li, Ibraheem Alhashim, Hao Zhang, Ariel Shamir, Daniel Cohen-Or.

Optimization of Pallet Packaging Space and a Robotic SCARA Manipulator for Package Stacking Group-4 Puneet Jethani Erica Neuperger Siddharth Kodgi Zarvan.

ICT 1 A heuristic for maritime inventory routing Oddvar Kloster, Truls Flatberg Jyväskylä,

Image Retrieval and Ranking using L.S.I and Cross View Learning Sumit Kumar Vivek Gupta

Upgrade Tips and Tricks

Evolutionary Algorithms and Hyper-Heuristics

USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.

Abolfazl Asudeh Azade Nazi Nan Zhang Gautam DaS

Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach

Particle Swarm Optimization

Chart Packing Heuristic

Kabanikhin S. I., Krivorotko O. I.

Load Balancing: List Scheduling

Bin Packing Optimization

The Price of information in combinatorial optimization

Machine Learning Feature Creation and Selection

The Subset Sum Game Revisited

The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’

Approximation Algorithms

Load Balancing: List Scheduling

Nesting by Shachaf Ben Jakov.

Presentation transcript:

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  Min (Optimal Volume/Actual Volume) Open Container Boxes

Problem Definition  Logistic  Container  Storage  Cutting Material  Space allocation

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

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

Literature Review  Layer Building  Moura and Oliveira, 2005  A. Bortfeldt and D. Mack 2007

Literature Review  Box Arrangement  Bortfeldt and Gehring, 1998  Eley 2002  Bortfeldt et al., 2003

Literature Review  Best Fit  E. K. Burke, G. Kendall, and G. Whitwell  S. Allen E. K. Burke G. Kendall  And manymore... GAP

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

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

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

Max Surround Touching  Touching top of the box

Max Surround Touching

 Touching top of the box

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

Min Rotation Score No Rotation

Min Rotation Score No Rotation

Min Rotation Score No Rotation

Min Rotation Score No Rotation

Min Rotation Score No Rotation

Min Volume Percentage  Optimal Volume/ Actual Volume

Min Volume Percentage

Tested Result  BR dataset – OR Library  BR10 – 87.2% (Best 87.6) Viewer created by Sam Allen

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

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

Thank you Questions