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 |