| 机器可选制造单元设计的半边图划分模型 |
| |
| 引用本文： | 孟朝晖. 机器可选制造单元设计的半边图划分模型[J]. 计算机工程与应用, 2005, 41(31): 61-65 |
| |
| 作者姓名： | 孟朝晖 |
| |
| 作者单位： | 河海大学计算机及信息工程学院,南京,210024 |
| |
| 摘 要： | 机器可选制造单元设计问题是一类含有多种局部约束的复杂组合优化问题,用图划分算法解决此类问题将会面临指数级个图的划分。论文提出半边图理论,半边附属于顶点,一对半边可结合为边。用半边及其结合性表示各种局部约束,将机器可选制造单元设计问题转化为基于半边图的组合优化问题,即计划路径可选的半边图划分问题。
|
| 关 键 词： | 半边 半边图 半边图划分 机器可选制造单元设计 |
| 文章编号： | 1002-8331-（2005）31-0061-05 |
| 收稿时间： | 2005-06-01 |
| 修稿时间： | 2005-06-01 |
Half Edge Graph Partitioning Model for Machine Redundant Manufacturing Cell Design |
| |
| Meng Zhaohui. Half Edge Graph Partitioning Model for Machine Redundant Manufacturing Cell Design[J]. Computer Engineering and Applications, 2005, 41(31): 61-65 |
| |
| Authors: | Meng Zhaohui |
| |
| Abstract: | Machine redundant manufacturing cell design is the complex combination optimal problem that has various constraints,Graph partition algorithm can't solve this problem,because the number of graphs that need to be partitioned is exponential.Proposed half edge graph theory,half edge belongs to vertex,a couple of half edges could assemble one edge.Half edge and its assembly can represent various constraints,Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge graph,multi-way half edge graph partitioning problem with redundant plan paths. |
| |
| Keywords: | half edge half edge graph half edge graph partitioning problem machine redundant manufacturing cell design |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
