Photo typesetting belongs to the rectangular packing problems, currently the algorithms of rectangular packing problems can be divided into two categories: heuristic methods and modern intelligent based methods. For both of these methods, the similarity of contents do not be well considered, the packing order of the rectangular pieces are chaos. Therefore, this drawback will cause problems for photo typesetting. In this paper we propose a hybrid algorithm for the photo typesetting problem based on kinship. According to our algorithm, the kinship of difierent photos is calculated by their absolute paths, and then all photos are packed based on the distance of their kinship. Compared with the existing methods, according to the computation of difierent scales of tests, our algorithm shows faster typesetting speed and higher utilization ratios. This algorithm could solve the sort problem caused by chaos typesetting photos of difierent customers after lots of photos were typeset. Our algorithm could greatly improve the practical application of photo typesetting.
[2]
Jan H. van Vuuren,et al.
New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
,
2010,
Eur. J. Oper. Res..
[3]
J. Åström.
Rotating bearings in regular and irregular granular shear packings
,
2008,
The European physical journal. E, Soft matter.
[4]
C. Borell.
Inequalities of the Brunn–Minkowski type for Gaussian measures
,
2007
.
[5]
Peng Wen.
A quick model for guillotine rectangle cutting problem
,
2010
.
[6]
Zhang Cheng-yi.
Intelligent nesting system with dual-population genetic algorithm
,
2011
.
[7]
Xiang Song,et al.
A beam search implementation for the irregular shape packing problem
,
2010,
J. Heuristics.
[8]
G. Agnarsson,et al.
On Minkowski Sums of Simplices
,
2006,
math/0605564.