检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《机械设计》2007年第1期43-45,共3页Journal of Machine Design
摘 要:针对装配作业规划问题,考虑了装配操作类型、装配并行度和重定向次数对装配作业的影响,将遗传算法与集对分析理论中的优选技术相结合,得到了一种装配顺序规划的新方法。为了有效地缩小遗传算法的搜索空间,采用了基于几何和工艺约束的启发算法。实例分析表明了该方法的有效性和可行性。Aiming at the problems of assembling operational planning, considering the influences on the assembling operation affected by the type of assembling operation, concurrent degree of assembly and number of times of redirection, this paper let the genetic algorithm be combined with the optimal selection technology of set pair analytical theory, a kind of new method of assembling sequence planning was obtained. For the sake of reducing effectively the searching space of genetic algorithm, the heuristic algorithm based on geometric and technological constraints was adopted. Analysis of living example showed the effectiveness and feasibility of this method.
分 类 号:TH132.4[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28