节点文献

求解装填布局问题的膨胀方法

Principle of Expansion Method for Layout Design

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 陆一平查建中

【Author】 LU Yi-Ping CHA Jian-Zhong(School of Mechanical and Control Engineering, Northern Jiaotong University, Beijing 100044)

【机构】 北方交通大学机械与控制工程学院!北京100044

【摘要】 介绍了膨胀装填布局的思想原理与算法实现 .膨胀装填布局通过对缩小了的装填物体系统地施加膨胀 -排斥操作而实现被装填物体布局位置的自动产生 ,具有直观性强、聚集性好、几何形状适应性广、便于工程推广等优点 .作为算例 ,使用膨胀装填算法对几种与平面圆相关的装填布局问题给出了计算结果 .

【Abstract】 In engineering design problems, layout design is often of the key, and layout is also often the main representation of creative work of the design result. Therefore the significance of design automation for engineering layout problem is obvious. But because of the NP-hard property of the layout problem, its complete solution needs long distance research. Presently, most solvent methods for layout problem are of heuristic and controlled stochastic methods. Most stochastic methods designate certain kind of filling or loading rules that generate layout styles. But the rationality of these rules can not be proved, and the optimum degree of the solution is also relatively not stable. As for the controlled stochastic methods, such as the simulated annealing and gene methods, their execution time is usually very long. Expansion method is a new solution method for layout problem that we devised during our research process on engineering layout problems. Its main idea is to find each layout item’s suitable location by making each layout item compete for its own space. We applied this method to circle packing and gear layout problems, and got good results. In this paper, after explanation of the general theory of the expansion method, three examples are given. The first example is the problem of ’packing n equivalent circles in a square’ (usually n=3 to 50 and more). This is a vastly researched problem in the field of optimization. For this problem, our programming practice shows that the best known packing styles can be easily acquired in a short time by expansion method. The second example is the layout problem of complex gear transmission system. This problem is much complicated, because there are complex meshing constrains between driving-driven gear pairs. Our programming practice demonstrates that expansion method is also suitable for these kinds of problems. The third example is a contrasting example. It is of the packing problem of unequal circles in a circle. We do performance contrast between expansion method and other methods named as physicalification and personification method. The result shows that the efficiency and stability of expansion method are better.

【关键词】 装填布局设计算法膨胀
【Key words】 packinglayout designalgorithmexpansion
【基金】 国家自然科学基金 ( 6 99740 0 2 )资助
  • 【文献出处】 计算机学报 ,Chinese Journal of Computers , 编辑部邮箱 ,2001年10期
  • 【分类号】TP391.7
  • 【被引频次】19
  • 【下载频次】141
节点文献中: 

本文链接的文献网络图示:

本文的引文网络