Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem

Bin Packing Problem is a branch of Cutting and Packing problems which has many applications in wood and metal industries. In this research we focus on non-oriented case of Two–Dimensional Rectangular Bin Packing Problem (2DRBPP). The objective of this problem is to pack a given set of small recta...

Full description

Saved in:

Bibliographic Details
Main Author:	Sarabian, Maryam
Format:	Thesis
Language:	English English
Published:	2010
Subjects:	Algorithms Genetic algorithms - Mathematical models Packaging
Online Access:	http://psasir.upm.edu.my/id/eprint/11988/1/FS_2010_5_A.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.11988
record_format	uketd_dc
spelling	my-upm-ir.119882013-05-27T07:50:37Z Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem 2010-03 Sarabian, Maryam Bin Packing Problem is a branch of Cutting and Packing problems which has many applications in wood and metal industries. In this research we focus on non-oriented case of Two–Dimensional Rectangular Bin Packing Problem (2DRBPP). The objective of this problem is to pack a given set of small rectangles, which may be rotated by 90˚, without overlaps into a minimum numbers of identical large rectangles. Our aim is to improve the performance of the MultiCrossover Genetic Algorithm (MXGA) proposed from the literature for solving the problem. We focus on four major components of the MXGA which consist of selection, crossover, mutation and replacement. Initial computational experiments are conducted independently on the named components using some benchmark problem instances. The most competitive techniques from each component are combined to form a new algorithm called Improved MXGA (MXGAi). Extensive computational experiments are performed using benchmark data sets to assess the effectiveness of the proposed algorithm. The MXGAi is shown to be competitive when compared with MXGA, Standard GA, Unified Tabu Search (UTS) and Randomised Descent Method (RDM). Algorithms Genetic algorithms - Mathematical models Packaging 2010-03 Thesis http://psasir.upm.edu.my/id/eprint/11988/ http://psasir.upm.edu.my/id/eprint/11988/1/FS_2010_5_A.pdf application/pdf en public masters Universiti Putra Malaysia Algorithms Genetic algorithms - Mathematical models Packaging Faculty Of Science English
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English English
topic	Algorithms Genetic algorithms - Mathematical models Packaging
spellingShingle	Algorithms Genetic algorithms - Mathematical models Packaging Sarabian, Maryam Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem
description	Bin Packing Problem is a branch of Cutting and Packing problems which has many applications in wood and metal industries. In this research we focus on non-oriented case of Two–Dimensional Rectangular Bin Packing Problem (2DRBPP). The objective of this problem is to pack a given set of small rectangles, which may be rotated by 90˚, without overlaps into a minimum numbers of identical large rectangles. Our aim is to improve the performance of the MultiCrossover Genetic Algorithm (MXGA) proposed from the literature for solving the problem. We focus on four major components of the MXGA which consist of selection, crossover, mutation and replacement. Initial computational experiments are conducted independently on the named components using some benchmark problem instances. The most competitive techniques from each component are combined to form a new algorithm called Improved MXGA (MXGAi). Extensive computational experiments are performed using benchmark data sets to assess the effectiveness of the proposed algorithm. The MXGAi is shown to be competitive when compared with MXGA, Standard GA, Unified Tabu Search (UTS) and Randomised Descent Method (RDM).
format	Thesis
qualification_level	Master's degree
author	Sarabian, Maryam
author_facet	Sarabian, Maryam
author_sort	Sarabian, Maryam
title	Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem
title_short	Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem
title_full	Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem
title_fullStr	Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem
title_full_unstemmed	Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem
title_sort	improved multicrossover genetic algorithm for twodimensional rectangular bin packing problem
granting_institution	Universiti Putra Malaysia
granting_department	Faculty Of Science
publishDate	2010
url	http://psasir.upm.edu.my/id/eprint/11988/1/FS_2010_5_A.pdf
_version_	1747811290038927360

Improved Multicrossover Genetic Algorithm For Twodimensional Rectangular Bin Packing Problem

Similar Items