Genetic Algorithms with Adaptive Meta-heuristics for 2D Packing Problem
In this paper we have proposed meta-heuristics for 2D packing problem. These heuristics are based on quasi-ordering and are adaptive. The meta-heuristics combined together with genetic algorithms supplied with appropriate parameters produce considerably improved, optimal or near-optimal, results.
KeywordsGenetic Algorithm Packing Problem Standard Genetic Algorithm Optimum Height Simple Partitioning
Unable to display preview. Download preview PDF.
- Jakobs, S. On genetic algorithms for the packing of polygons, European Journal of Operational Research 88 (1996) 165–181Google Scholar
- Khuri, S. Evolutionary Heuristics for the Bin Packing Problem, Artificial Neural Nets and Genetic Algorithms, Proceeding of the International Conference, Ales, France, 1995Google Scholar