装配序列规划问题的Benchmark生成算法  

A benchmark generation algorithm for assembly sequence planning

作　　者：刘华[1] 古天龙[1] 

机构地区：[1]桂林电子科技大学计算机与控制学院,广西桂林541004

出　　处：《桂林电子科技大学学报》2010年第2期141-145,共5页Journal of Guilin University of Electronic Technology

基　　金：广西自然科学基金(0832006Z)

摘　　要：装配序列规划本质上是一个NP组合优化问题,由于缺乏Benchmark,使得研究者在提出装配序列规划算法时难以对算法的优劣进行衡量。针对该问题,借鉴索玛立方体中将若干单位立方块组合成不同几何体的思想,在主要由连接矩阵和干涉矩阵构成的装配体模型表示法的基础上,设计了自动生成装配体和提取其模型数据的算法,并通过实验证明了算法的正确性。最后利用Matlab编程开发了该Benchmark自动生成系统,可以为装配序列规划算法提供有效的输入数据,进而对算法进行评价。Assembly sequence planning（ASP） is essentially an issue of NP combinatorial optimization.Due to lack of benchmark,various algorithms proposed by researchers for the ASP problem can not be compared and well measured.To solve this problem,in light of the SOMA cube in which various geometric solids are constructed from basic unit-cubes,an approach for generating assemblies automatically is proposed and an algorithm for extracting the model data of these assemblies is also presented based on a combination of the connection matrix and the interference matrix,and the validity of them is also demonstrated by experiments.Both the approach and the algorithm are implemented with Matlab.This work provides an approach for（1） generating input data for ASP algorithms and（2） evaluating different ASP algorithms.

关 键 词：装配序列规划 装配体模型 算法评价 BENCHMARK MATLAB 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]