Based on the Hybrid Genetic Simulated Annealing Algorithm for Solving Rectangle-Packing

Article Preview

Abstract:

The improve hybrid genetic algorithms is proposed using the notion of species for solving rectangle-packing problems.This can control the rate of the variation,which makes result to the best.The rectangle-packing is irregular objects use them of the best rectangle to replace.The experiment results show hybrid genetic algorithms is kind of efficient and reliable optimization arithmetic and it has determinate applied value.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

931-935

Citation:

Online since:

February 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Huang xujing. With a preselected depth search steps make it rigidly uniform two-dimensional rectangular optimal layout [J]. Journal of computer-aided design & computer graphics . 1996, 6 ( 4): 313-316.

Google Scholar

[2] Graham RL. An efficient algorithm for determining the convex hull of a finite planer set. Info. proc. Lett., 1972, 1: 132-133.

Google Scholar

[3] Cao xinming, Jiang ruibin. The minimum enclosure rectangle of irregular parts for research[J]. Bulletin of science and technology. 2007, 1(23): 21-22.

Google Scholar

[4] Wang lin, Intelligent optimization algorithm and its application[M]. Tsinghua University press. (2001).

Google Scholar

[5] Liu Dequan. Rectangular packing problem genetic algorithm for solving [J]. Micro computer system. In 1998, 12: 20-25.

Google Scholar

[6] Jia Zhixin, Yin Guofu, Luo Yang, Xu Lei. The layout of rectangle parts of the simulated annealing algorithm [J]. Journal of Sichuan University ( Engineering Science Edition ), 2001, 33 ( 5): 35-38.

Google Scholar