A Genetic Algorithm for Two-Dimensional Bin Packing Problem
This paper considers a non-oriented twodimensional bin packing problem, where a set of small rectangles, which may be rotated by 90°, has to be allocated to one or more identical bins. A genetic algorithm (GA) hybridised with a heuristic placement routine is proposed to solve the problem. The...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Institute for Mathematical Research
2008
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/12464/ http://psasir.upm.edu.my/id/eprint/12464/1/Artikel_6_vol2_no1.pdf |
| _version_ | 1848841850201309184 |
|---|---|
| author | Lee, Lai Soon |
| author_facet | Lee, Lai Soon |
| author_sort | Lee, Lai Soon |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | This paper considers a non-oriented twodimensional
bin packing problem, where a set of
small rectangles, which may be rotated by 90°, has
to be allocated to one or more identical bins. A
genetic algorithm (GA) hybridised with a heuristic
placement routine is proposed to solve the problem.
The algorithm employs an innovative crossover
operator that considers a number of different
children from each pair of parents. Comprehensive
results are presented, and the algorithm is shown to
be competitive when compared with other
metaheuristic algorithms. |
| first_indexed | 2025-11-15T07:49:47Z |
| format | Article |
| id | upm-12464 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T07:49:47Z |
| publishDate | 2008 |
| publisher | Institute for Mathematical Research |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-124642013-05-27T07:52:25Z http://psasir.upm.edu.my/id/eprint/12464/ A Genetic Algorithm for Two-Dimensional Bin Packing Problem Lee, Lai Soon This paper considers a non-oriented twodimensional bin packing problem, where a set of small rectangles, which may be rotated by 90°, has to be allocated to one or more identical bins. A genetic algorithm (GA) hybridised with a heuristic placement routine is proposed to solve the problem. The algorithm employs an innovative crossover operator that considers a number of different children from each pair of parents. Comprehensive results are presented, and the algorithm is shown to be competitive when compared with other metaheuristic algorithms. Institute for Mathematical Research 2008-12 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/12464/1/Artikel_6_vol2_no1.pdf Lee, Lai Soon (2008) A Genetic Algorithm for Two-Dimensional Bin Packing Problem. Math Digest : Research Bulletin Institute for Mathematical Research, 2 (1). pp. 34-39. ISSN 1985-2436 English |
| spellingShingle | Lee, Lai Soon A Genetic Algorithm for Two-Dimensional Bin Packing Problem |
| title | A Genetic Algorithm for Two-Dimensional Bin Packing Problem |
| title_full | A Genetic Algorithm for Two-Dimensional Bin Packing Problem |
| title_fullStr | A Genetic Algorithm for Two-Dimensional Bin Packing Problem |
| title_full_unstemmed | A Genetic Algorithm for Two-Dimensional Bin Packing Problem |
| title_short | A Genetic Algorithm for Two-Dimensional Bin Packing Problem |
| title_sort | genetic algorithm for two-dimensional bin packing problem |
| url | http://psasir.upm.edu.my/id/eprint/12464/ http://psasir.upm.edu.my/id/eprint/12464/1/Artikel_6_vol2_no1.pdf |