A Modified Partially Mapped MultiCrossover Genetic Algorithm for Two-Dimensional Bin Packing Problem
M. Sarabian and L.S. Lee
DOI : 10.3844/jmssp.2010.157.162
Journal of Mathematics and Statistics
Volume 6, Issue 2
Problem statement: Non-oriented case of Two-Dimensional Rectangular Bin Packing Problem (2DRBPP) was studied in this study. The objective of this problem was 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 was to improve the performance of the MultiCrossover Genetic Algorithm (MXGA) proposed from the literature for solving the problem. Approach: Four major components of the MXGA consisted of selection, crossover, mutation and replacement are considered in this study. Initial computational investigations were conducted independently on the named components using some benchmark problem instances. The new MXGA was constructed by combining the rank selection, modified Partially Mapped Crossover (PMXm), mutation with two mutation operators and elitism replacement scheme with filtration. Results: Extensive computational experiments of the new proposed algorithm, MXGA, Standard GA (SGA), Unified Tabu Search (UTS) and Randomized Descent Method (RDM) were performed using benchmark data sets. Conclusion: The computational results indicated that the new proposed algorithm was able to outperform MXGA, SGA, UTS and RDM.
© 2010 M. Sarabian and L.S. Lee. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.