Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems
In this study, we consider non-oriented and oriented cases of Two-Dimensional Rectangular Bin Packing Problems where a given set of small rectangles is packed without overlaps into a minimum number of identical large rectangles. In non-oriented case the rectangles are allowed to be rotated at 90°...
Saved in:
Main Author: | |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2009
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/5756/1/A__FS_2009_9.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this study, we consider non-oriented and oriented cases of Two-Dimensional
Rectangular Bin Packing Problems where a given set of small rectangles is
packed without overlaps into a minimum number of identical large rectangles. In
non-oriented case the rectangles are allowed to be rotated at 90° while the
rectangles have fixed orientation in oriented case. We propose new heuristic
placement routines called the Improved Lowest Gap Fill (LGFi) (for nonoriented
case) and LGF |
---|