检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄风立[1] 左春柽[1] 顾金梅[1] 王海燕[1] 张礼兵[1]
出 处:《机械工程学报》2017年第7期164-172,共9页Journal of Mechanical Engineering
基 金:国家自然科学科学基金(61403163);浙江省自然科学基金(LY13E050021;LQ14G010008);浙江省公益性技术应用研究计划(2015C31069)资助项目
摘 要:针对基于加工特征的计算机辅助装夹规划问题,提出一种基于多态蚁群算法的装夹规划优化方法。根据零件的加工特征,定义了加工操作单元,建立零件的装夹规划模型;接着提出了集成顺序优先约束的多态蚁群求解装夹规划的优化算法。其中顺序优先约束是通过对加工操作单元的划分,实现禁忌加工操作单元的动态调整;多态蚁群算法将局域搜索与全局搜索进行结合,并根据状态转移概率在可行的加工操作单元中进行选择,完成整个装夹路径的规划。最后通过典型零件装夹规划的实例,验证了提出的多态蚁群算法在求解装夹规划问题中的可行性和有效性。Aiming at the computer assisted clamping programming problem based on machining features, the clamping planning optimization method is proposed based on polymorphic ant colony algorithm. According to the machining features of part, define the machining operation unit, build the clamping planning model, then the integration order priority constraints polymorphic ant colony clamping planning optimization method is proposed. Where, order priority constraints is adjusted by dynamically taboo processing operation units by classifying machining operation units. Polymorphic ant colony algorithm is combined local search with global search, according to the state transition probability to choose in the feasible machining operation units, complete the planning of the clamping path. Finally, the feasibility and effectiveness of the polymorphic ant colony in solving the clamping planning problem is verified by the instances of typical parts clamping planning.
分 类 号:TH162[机械工程—机械制造及自动化] TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.71.192