基于混合遗传算法的复杂箱体零件工艺路线优化
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Optimization of Process Route for Complicated Box Parts Based on Hybrid Genetic Algorithm
  • 作者:潘玉玲 ; 罗亚波
  • 英文作者:PAN Yu-ling;LUO Ya-bo;School of Mechanical and Electrical Engineering,Wuhan University of Technology;
  • 关键词:复杂箱体零件 ; 工艺路线 ; 遗传算法 ; 变邻域搜索
  • 英文关键词:complex box parts;;process route;;genetic algorithm;;variable neighborhood search
  • 中文刊名:ZHJC
  • 英文刊名:Modular Machine Tool & Automatic Manufacturing Technique
  • 机构:武汉理工大学机电工程学院;
  • 出版日期:2019-02-20
  • 出版单位:组合机床与自动化加工技术
  • 年:2019
  • 期:No.540
  • 基金:国家自然科学基金项目(51375357);; 湖北省高等学校省级教学研究项目(2017122)
  • 语种:中文;
  • 页:ZHJC201902028
  • 页数:5
  • CN:02
  • ISSN:21-1132/TG
  • 分类号:108-112
摘要
针对计算机辅助工艺规划(CAPP)中的工艺路线的优化问题,提出一种以遗传算法和变邻域搜索结合的混合算法。通过分析将箱体类零件的工艺路线优化转化为加工单元的排序优化,以机床、刀具和装夹面变换次数最少为优化目标,根据箱体零件的加工单元的优先关系、设备唯一性建立约束条件,利用改进的遗传算法和设计的4种变邻域操作结合,避免了单一遗传算法的"早熟"缺点,最后实例验证结果表明混合算法性能更优。
        Aiming at the optimization of process routes in computer-aided process planning( CAPP),a hybrid algorithm combining genetic algorithm and variable neighborhood search is proposed. Through analysis,the optimization of the process route of the box parts is converted into the optimization of the processing unit. The objective optimization function is established by the least number of machine tools,fixtures and tool transformations. The constraint conditions are established according to the priority relationship and uniqueness of the processing unit of the box parts. With the combination of the improved genetic algorithm and the designed four kinds of variable neighborhood operations,the " early maturing" shortcomings of the single genetic algorithm are avoided. Finally,the example verification results show that the hybrid algorithm has better performance.
引文
[1]刘岩,段国林,蔡瑾.基于遗传算法的加工操作排序及优化[J].组合机床与自动化加工技术,2016(11):126-129.
    [2]王军,孟庆智.基于遗传算法与约束矩阵的工艺路线优化方法研究[J].制造技术与机床,2011(8):147-152.
    [3]郑永前,王阳.基于遗传算法的加工工艺决策与排序优化[J].中国机械工程,2012,23(1):59-65.
    [4]蒲建,王先逵,吴丹,等.工艺规划中的组合问题[J].清华大学学报:自然科学版,1997,37(8):69-71.
    [5]徐立云,史楠,段建国,等.基于特征加工元的复杂箱体类零件工艺路线优化[J].中国机械工程,2013,24(2):202-208.
    [6]Ma G H,Zhang Y F,Nee A Y C. A simulated annealing-based optimization algorithm for process planning[J]. In-ternational Journal of Production Research,2000,38(12):2671-2687.
    [7]黄学文,张晓彤,艾亚晴.基于蚁群算法的多加工路线柔性车间调度问题[J].计算机集成制造系统,2018,24(3):558-569.
    [8]Leung C W,Wong T N,Mak K L,et al. Integrated processplanning and scheduling by an agent-based ant colony opti-mization[J]. Computers&Industrial Engineering,2010,59(1):166-180.
    [9]常智勇,杨建新,赵杰,等.基于自适应蚁群算法的工艺路线优化[J].机械工程学报,2012,48(9):163-169.
    [10]崔光鲁,陈劲杰,徐希羊,等.基于Hopfield神经网络的打磨工艺路线优化[J].电子科技,2017,30(5):36-39.
    [11]Chang C A,Angkasith V. Using Hopfield neural networksfor operational sequencing for prismatic parts on NC ma-chines[J]. Engineering Applications of Artificial Intelli-gence,2001,14(3):357-368.
    [12] Gao J,Sun L,Gen M. A hybrid genetic and variableneighborhood descent algorithm for flexible job shop schedu-ling problems[J]. Computers&Operations Research,2008,35(9):2892-2907.
    [13]M Amiri,M Zandieh,M Yazdani,et al. A variable neigh-bourhood search algorithm for the flexible job-shop schedu-ling problem[J]. International Journal of Production Re-search,2010,48(19):5671-5689.
    [14]张则强,谭思捷,黄玉真,等.求解单行布局问题的一种变邻域搜索算法[J].中国机械工程,2013,24(20):2791-2796.
    [15]赵诗奎.求解柔性作业车间调度问题的两级邻域搜索混合算法[J].机械工程学报,2015,51(14):175-184.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700