摘要
研究圆排列包装问题,给出该问题的数学模型及其简化形式.通过研究圆排列包装问题的最优解的性质,将该问题的数学模型进一步转化为一个较易求解的数学模型,并给出一个关于其最优解的定理和证明.该定理表明:按半径大小降序排列且两两相切的圆排列为圆排列包装问题的一个最优圆排列.
A research on circle permutation packing problem is considered, and the model of circle permutation packing problem and its simplified form are given. By researching the propertie of optimization in circle permutation packing problem, the model of the problem is further converted into a relatively easy solving mathematical model, and the theorem about its optimization and its proof are given. The theorem shows that a circle permutation according to the radius size in descending order, in which every double adjacent rounds touch at each other, is an optimal circle permutation of circle permutation packing problem.
出处
《华侨大学学报（自然科学版）》
CAS
北大核心
2013年第2期220-224,共5页
Journal of Huaqiao University(Natural Science)
基金
华侨大学科研基金资助项目(10HZR26)
关键词
圆排列
包装问题
两两相切
顺序排列
反向操作
circle permutation
packing problem
touch at each other~ sequence permutation
reverse operation
