Abstract: Rectangular packing problem is NP-Hard and normally solved by heuristic
algorithms. By combining simulated annealing with genetic algorithm, an adaptive algorithm for
rectangular packing problem is presented. The placement function for the structural algorithm is
studied. Some strategies such as adaptive crossover, mutation and the probability of accepting
poor solution can be used in order to optimize the parameter of placement function. The algorithm
through two way determination initial population's number has the strong compatibility. In the
algorithm search’s later period, the most different individual is used to carry on crossover
operation, thus maintains the population’s multiplicity. The experimental results show that the
algorithm is reasonable and efficient with comparing ones of other algorithms.

Key words: computer application, rectangular packing problems, genetic algorithm;
simulated annealing, combination optimization