期刊文献+

逐步求解的装配顺序规划方法 被引量:1

Step by step solution method for assembly sequence planning
下载PDF
导出
摘要 产品装配是一个为已装配体尚未完成装配的配合寻找可装配件的过程。针对该特点,提出逐步评判的装配顺序求解方法。建立装配规划约束的编码矩阵,采用混合编码的方式表示几何约束和语义约束。以混合编码矩阵为基础,通过装配约束推理和判断获得产品装配过程每一步的可行装配方案,作为装配顺序评价集。以装配方向改变、装配工具改变、装配体的稳定性和装配准确度要求作为规划因素集,运用多因素模糊综合评判方法为已装配体获取最优的装配方案,逐步缩小求解空间,直到规划完成所有零件的装配顺序。将该方法应用于某机型舱门骨架装配规划中,结果表明该方法合理、有效,能够满足工程实际需求。 Aiming at the feature of product assembly, a step by step judging method for assembly sequence planning was proposed. Assembly constrain code matrix was presented to represent geometry constrain and assembly seman- tic constrain with hybrid coding. Based on the hybrid coding matrix, assembly constrains reasoning was used to i- dentify all feasibly assembly plans of each step in assembly process as assembly sequence evaluation set. By taking the assembly direction change, the assembly tool change, the assembly stability and the assembly accuracy as the factor set of assembly plan, the multi-factor fuzzy comprehensive evaluation method was used to obtain the optical assembly plan for the parts being assembled. The solution space was gradually narrowed until the assembly se- quences of all parts were obtained. The proposed method was applied to the assembly planning of a cabin door frame, and the result showed that the method was validated and could meet the engineer requirements.
出处 《计算机集成制造系统》 EI CSCD 北大核心 2014年第11期2767-2773,共7页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(51275234) 河北省应用基础研究计划重点基础研究资助项目(14961811D) 河北省高等学校科学技术研究资助项目(QN2014207) 河北科技大学校立科研基金资助项目(TY27)~~
关键词 装配顺序 装配规划 逐步求解 混合编码 模糊评判 assembly sequence assembly planning step by step solution hybrid coding fuzzy evaluation
  • 相关文献

参考文献14

二级参考文献84

共引文献117

同被引文献14

  • 1BOURJAULT A,LHOTE A.Modelling an assembly process[C]//Proceedings of IEEE International Conference on Automation of Manufacturing Industry.Washington,D.C.,USA:IEEE,1986:183-198.
  • 2DE FAZIO T L,WHITNEY D E.Simplified generation of all mechanical assembly sequences[J].IEEE Journal of Robotics and Automation,1987,3 (6):640-658.
  • 3LIAO C J,LIAO Liman.Improved MILP models for two-machine flowshop with batch processing machines[J].Mathematical and Computer Modelling,2008,48(7/8):1254-1264.
  • 4POTTS C N,KOVALYOV M Y.Scheduling with batehing:Areview[J].European Journal of Operational Researeh,2000,120(2):228-249.
  • 5BAPTISTE P.Batehing identical jobs[J].Mathematical Methods of Operations Research,2000,52(3):355-367.
  • 6SPANOS A C,PONIS S T,ROKOU E.A new hybrid parallel genetic algorithm for the job-shop scheduling problem[J].International Transactions in Operational Research,2013,21(3):479-499.
  • 7REY G Z,BEKRAR A,PRABHU V,et al.Coupling a genetic algorithm with the distributed arrival-time control for the JIT dynamic scheduling of flexible job-shops[J].International Journal of Production Research,2014,55 (3):3688-3709.
  • 8GONCALVES J F,RESENDE M G C.An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling[J].International Transactions in Operational Research,2013,21(2):215-246.
  • 9KUDIKALA R,KALYANMOY D,BHATTACHARYA B.Multi-objective optimization of piezoelectric actuator placement for shape control of plates using genetic algorithms[J].Journal of Mechanical Design,2008,131 (9):153-165.
  • 10周辉仁,郑丕谔,安小会,宗蕴.基于遗传算法求解Job Shop调度优化的新方法[J].系统仿真学报,2009,21(11):3295-3298. 被引量:9

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部