Genetic Algorithm For Two-Dimensional Packing Problem

The packing problem is a traditional NP-hard problem, it is a classic combinatorial optimization problem. The packing problem are reviewed, summarizes the algorithm of the packing problem, one of the most commonly used heuristic algorithms and genetic algorithms. Secondly, briefly discusses the basic mechanism of the genetic algorithm, with emphasis on the concepts and ideas of the single parent genetic algorithm is described, and then were analyzed for two-dimensional rectangular packing problem FFA algorithm and its improved algorithm IFFA and IFFA2algorithm introduction of a certain amount. Finally, on the basis of the IFFA2algorithm, taking into account a certain amount of items into multiple boxes proposed IFFA3algorithm, algorithm, taking into account the order of the items boxed items orientation as well as box the number of control coding schemes, and design a new fitness function, introduced in the decoding process IFFA3algorithm, heuristic algorithm and genetic algorithm combined with organic.