Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems

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

[img] PDF
201Kb

Abstract

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

Item Type:Thesis (Masters)
Subject:Heuristic programming - Bins - Combinatorial packaging and covering - Case studies
Chairman Supervisor:Lee Lai Soon, PhD
Call Number:FS 2009 9
Faculty or Institute:Faculty of Science
ID Code:5756
Deposited By: Nurul Hayatie Hashim
Deposited On:28 Apr 2010 09:27
Last Modified:27 May 2013 07:24

Repository Staff Only: item control page

Document Download Statistics

This item has been downloaded for since 28 Apr 2010 09:27.

View statistics for "Heuristic Placement Routines For Two-Dimensional Rectangular Bin Packing Problems "


Universiti Putra Malaysia Institutional Repository

Universiti Putra Malaysia Institutional Repository is an on-line digital archive that serves as a central collection and storage of scientific information and research at the Universiti Putra Malaysia.

Currently, the collections deposited in the IR consists of Master and PhD theses, Master and PhD Project Report, Journal Articles, Journal Bulletins, Conference Papers, UPM News, Newspaper Cuttings, Patents and Inaugural Lectures.

As the policy of the university does not permit users to view thesis in full text, access is only given to the first 24 pages only.