摘要
计划路径可选的半边图划分问题是一类含有多种局部约束的复杂组合优化问题。设计了针对半边图划分问题的半边图挤出吸入算法,用此算法求解了机器可选制造单元成组设计问题。示例表明,半边图语言能够准确地表达可能解中的复杂结构和各种约束。20台机器20种零件分组实验证明,平均12.4次迭代计算即可达到优化目标。
Muhi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint.Having Designed an extrude intake algorithm for the half edge graph partitioning problem,this algorithm can solve machine redundant manufacturing cell design problem.Half edge graph theory can represent complex structure and various constraint accurately.For a 20-20 example,on 12.4 average times extrude and intake can get the optimizm solution.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第33期38-41,44,共5页
Computer Engineering and Applications
关键词
半边图
半边图划分挤出吸入算法
机器可选制造单元设计
half edge graph,half edge graph partitioning problem,extrude intake algorithm,machine redundant manufacturing cell design
