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°...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/5756/ http://psasir.upm.edu.my/id/eprint/5756/1/A__FS_2009_9.pdf |
| _version_ | 1848840188319498240 |
|---|---|
| author | Wong, Lily |
| author_facet | Wong, Lily |
| author_sort | Wong, Lily |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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 |
| first_indexed | 2025-11-15T07:23:22Z |
| format | Thesis |
| id | upm-5756 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T07:23:22Z |
| publishDate | 2009 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-57562013-05-27T07:24:56Z http://psasir.upm.edu.my/id/eprint/5756/ Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems Wong, Lily 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 2009 Thesis NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/5756/1/A__FS_2009_9.pdf Wong, Lily (2009) Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems. Masters thesis, Universiti Putra Malaysia. Heuristic programming - Bins - Combinatorial packaging and covering - Case studies English |
| spellingShingle | Heuristic programming - Bins - Combinatorial packaging and covering - Case studies Wong, Lily Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems |
| title | Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems
|
| title_full | Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems
|
| title_fullStr | Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems
|
| title_full_unstemmed | Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems
|
| title_short | Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems
|
| title_sort | heuristic placement routines for two-dimensional rectangular bin packing problems |
| topic | Heuristic programming - Bins - Combinatorial packaging and covering - Case studies |
| url | http://psasir.upm.edu.my/id/eprint/5756/ http://psasir.upm.edu.my/id/eprint/5756/1/A__FS_2009_9.pdf |