Simple Search:

Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems


Citation

Wong, Lily (2009) Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems. Masters thesis, Universiti Putra Malaysia.

Abstract / Synopsis

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


Download File

[img]
Preview
PDF
A__FS_2009_9.pdf

Download (206kB)

Additional Metadata

Item Type: Thesis (Masters)
Subject: Heuristic programming - Bins - Combinatorial packaging and covering - Case studies
Call Number: FS 2009 9
Chairman Supervisor: Lee Lai Soon, PhD
Divisions: Faculty of Science
Depositing User: Nurul Hayatie Hashim
Date Deposited: 28 Apr 2010 09:27
Last Modified: 27 May 2013 07:24
URI: http://psasir.upm.edu.my/id/eprint/5756
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item