|
|||||
|
|
| 基于蚁群优化算法的目标拆卸序列规划 | |
| 引用本文： | 薛俊芳,邱长华,向东.基于蚁群优化算法的目标拆卸序列规划[J].计算机辅助设计与图形学学报,2007,19(6):742-747. |
| 作者姓名： | 薛俊芳 邱长华 向东 |
| 作者单位： | 1. 哈尔滨工程大学机电工程学院,哈尔滨,150001;内蒙古工业大学机械学院,呼和浩特,010051 2. 哈尔滨工程大学机电工程学院,哈尔滨,150001 3. 清华大学精密仪器与机械学系,北京,100084 |
| 摘 要： | 为了能够以较高的效率求解出产品中目标零件的拆卸方案,基于产品中零件间的拆卸优先约束关系,提出并建立目标零件的拆卸层次信息图模型,将目标零件的拆卸序列规划问题转化为对该图模型中具备最优值的路径的搜索和寻优问题.同时,提出一种改进蚁群优化算法,以实现对目标零件拆卸层次信息图的构建和对拆卸方案的搜索与寻优.最后通过实例验证了该方法的可行性和计算效率. |
| 关 键 词： | 目标拆卸序列规划 拆卸层次信息图 优先约束 蚁群优化算法 蚁群优化算法 目标 序列规划 Optimization Algorithm Based Sequence Disassembly Selective 计算效率 方法 实例验证 信息图 层次信息 改进 规划问题 寻优 搜索 路径 优值 转化 |
| 收稿时间： | 2006-10-19 |
| 修稿时间： | 2006-10-192006-12-28 |
Planning of Selective Disassembly Sequence Based on Ant Colony Optimization Algorithm |
|
| Xue Junfang,Qiu Changhua,Xiang Dong.Planning of Selective Disassembly Sequence Based on Ant Colony Optimization Algorithm[J].Journal of Computer-Aided Design & Computer Graphics,2007,19(6):742-747. | |
| Authors: | Xue Junfang Qiu Changhua Xiang Dong |
| Affiliation: | College of Electromechanical Engineering, Harbin Engineering University, Harbin 150001; College of Mechanical Engineering, Inner Mongolia University of Technology, Hohhot 010051;Department of Precision Instruments and Mechanology , Tsinghua University, Beijing 100084 |
| Abstract: | To tackle selective disassembly sequence planning problem efficiently,disassembly hierarchy information graph(DHIG) based on precedence constraints is presented firstly.The problem of selective disassembly sequence planning is transformed into that of searching optimal paths in the graph.An improved ant colony optimization algorithm is presented to build the DHIG and search the optimal solutions.Finally,an example is used to verify the feasibility and calculating efficiency of the proposed method. |
| Keywords: | selective disassembly sequence planning disassembly hierarclay information graph precedenceconstraints ant colony optimization algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |