期刊文献+

基于混合算法的内燃机曲柄连杆机构复合目标选配 被引量:8

MULTI-OBJECTIVE SELECTIVE ASSEMBLY OF INTERNAL-COMBUSTION ENGINE LINKAGE OF CRANK-ROD BASED ON IMPROVED HYBRID GENETIC ALGORITHM
下载PDF
导出
摘要 在曲柄连杆机构的选配中,为实现在多种装配要求的条件下,对多对零部件同时进行选配,并使剩余的零部件数量最少的复合目标,以提高曲柄连杆机构各零部件的选配成功率和装配质量,建立了复合目标选配的目标函数,确定了约束条件。针对该组合优化问题的特殊性,对传统的基于遗传算法和模拟退火算法的混合算法进行了改进,提高了在初始种群产生阶段进行定向变异的方法,以提高初始种群的平均适应度;并设计了特定的编码方式、交叉运算和变异运算,建立了曲柄连杆机构的复合目标选配方法。最后对该方法进行了有效性验证。 During the course of selective assembly of internal-combustion engine linkage of crank-rod, in order to achieve multi-objective that includes mating several pairs of parts in respective assembly precision demands at the same time, making the surplus parts minimum and increasing the mate rate and the assembly quality of the parts within the linkage of crank-rod, an objective function of multi-objective selective assembly is built and restriction conditions are defined. Then considering the speciality of this combinatorial optimization problem, the conventional hybrid algorithm based on genetic algorithm and simulated annealing algorithm is improved, and a method, to take a directional mutation when forming the initial population, is presented to boost the average fitness of the initial population, meanwhile, specific coding operation, specific crossover operator and specific mutation operator are designed, thereby a multi-objective selective assembly method of the linkage of crank-rod is built. Finally the validity of such method is proved by a practical example.
出处 《机械工程学报》 EI CAS CSCD 北大核心 2006年第1期155-161,共7页 Journal of Mechanical Engineering
基金 教育部留学归国基金资助项目(200213B2)。
关键词 曲柄连杆机构 复合目标 遗传算法 定向变异 选配 Linkage of crank-rod Multi-objective Genetic algorithm Directional mutation Selective assembly
  • 相关文献

参考文献5

二级参考文献20

  • 1P C Gilmore, R E Gomory. A linear programming approach to the cutting stock problem-Part 1 [J ] . Operations Research,1961, 9(6): 848-859.
  • 2J E Beasley. Algorithms for unconstrained two-dimensional guillotine cutting [ J ] . Journal of the Operational Research Society, 1985, 36(4) : 297-306.
  • 3A A Farley. Mathematical programming models for cutting-stock problems in the clothing industry [ J ] . Journal of the Operational Research Society, 1988, 39( 1): 41-53.
  • 4M S Reda, E A Abd. An interactive technique for the cutting stock problem with multiple objects[J ] . European Journal of Operational Research, 1994, 78(3) : 304-317.
  • 5M Shpitalni, V Menevich. Optimal orthogonal subdivision of rectangular sheets [ J ] . Transactions of ASME Journal of Manufacturing Science end Engineering, 1996, 118(3) : 281-288.
  • 6M Adamowicz. The optimum two-dimensional allocation of irregular, multiple-connected shapes with linear, logical and geometric constralnts[D]. New York: New York University,1969.
  • 7H H Yanasse, A S I Zinober, R G Harris. Two-dimensional cutting stock with multiple stock sizes [ J ] . Journal of the Operational Research Society, 1991, 42(8) : 673-683.
  • 8S Jakobs. On genetic algorithms for the packing of polygons[J].European Journal of Operational Research, 1996, 88( 1 ) : 165-181.
  • 9A Ramesh Babu, N Ramesh Babu. Effective nestin4g of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms [ J ] . International Journal of Production Research, 1999, 37(7): 1625-1643.
  • 10G-C Han, S-J Na. Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annesling[J]. Journal of Engineering Manufacture, 1996, 210(B6): 509-519.

共引文献346

同被引文献57

引证文献8

二级引证文献35

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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