当前位置:主页 > 科技论文 > 自动化论文 >

基于花朵授粉算法的产品拆卸序列规划

发布时间:2018-03-14 17:56

  本文选题:拆卸序列规划 切入点:花朵授粉算法 出处:《计算机集成制造系统》2016年12期  论文类型:期刊论文


【摘要】:针对产品拆卸序列规划问题,提出一种基于花朵授粉算法的求解拆卸序列规划问题的方法。结合智能优化算法求解拆卸序列规划问题的特点,采用遗传算法的优先关系保留交叉操作方式,对花朵授粉算法的授粉方式进行了离散化处理。在建立离散花朵授粉算法的基础上,构建了评价拆卸序列质量的适应度函数模型。通过实例对离散花朵授粉算法在不同初始条件设置的情况下进行了实验分析,并与遗传算法进行了比较,证明了所提算法的可行性与优越性。
[Abstract]:Aiming at the product disassembly sequence planning problem, a method based on flower pollination algorithm is proposed to solve the disassembly sequence planning problem, which combines the characteristics of intelligent optimization algorithm to solve the disassembly sequence planning problem. In this paper, the priority relation of genetic algorithm (GA) is used to preserve the cross operation mode, and the pollination method of the flower pollination algorithm is discretized, and the discrete flower pollination algorithm is established based on the discrete flower pollination algorithm. A fitness function model for evaluating the quality of disassembly sequence is constructed. The discrete flower pollination algorithm is experimentally analyzed under different initial conditions and compared with genetic algorithm. The feasibility and superiority of the proposed algorithm are proved.
【作者单位】: 装甲兵工程学院兵器工程系;
【基金】:军队科研计划项目~~
【分类号】:TP18


本文编号:1612314

资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/zidonghuakongzhilunwen/1612314.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户a247a***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com