期刊文献+

多约束下矩形件排样问题的混合求解算法研究 被引量:1

Research on Hybrid Solution Algorithm for Layout Problem of Rectangular Parts with Multiple Constraints
原文传递
导出
摘要 针对板材和玻璃下料过程中存在的矩形件排样问题,提出了一种基于分割匹配算法与改进蚁群算法的混合算法进行求解。建立了以最大化均方利用率和剩余加工时间为目标的排样优化模型;利用蚁群算法作为排样顺序算法确定部分零件的排样顺序以满足零件的加工时间限制,为了提高蚁群算法搜索效率,提出了自适应信息素更新策略,引入基于遗传变异和2-opt变异的混合变异策略来增强局部搜索能力。针对于零件在毛坯上位置的排布问题,为提高毛坯的均方利用率同时又满足一刀切约束条件,提出分割匹配算法进行矩形件排布优化。将改后的算法与其他优化算法用国际标准测试案例和企业实际案例进行对比分析,验证了所提混合算法的有效性。 A hybrid algorithm based on a cutting and matching algorithm and an improved ant colony algorithm was proposed to solve the layout problem of rectangular parts in the process of wood and glass blanking.A layout optimization model was established to maximize the mean square utilization and the remaining processing time;the ant colony algorithm was used as the layout sequence algorithm to determine the layout sequence of some parts and meet the processing time constraint.In order to improve the search efficiency of the ant colony algorithm,an adaptive pheromone updating strategy was proposed,and a hybrid mutation strategy based on genetic mutation and 2-opt mutation was introduced to enhance the local search capability.For the arrangement of parts on the workblank,in order to improve the mean square utilization of the workblank and meet the guillotine constraint,a cutting and matching algorithm was proposed to optimize the layout of rectangular parts.Finally,the improved algorithm was compared with other optimization algorithms by international standard test cases and actual enterprise cases,and the effectiveness of the proposed hybrid algorithm was verified.
作者 刘野 吉卫喜 苏璇 赵宏轩 Liu Ye;Ji Weixi;Su Xuan;Zhao Hongxuan(School of Mechanical Engineering,Jiangnan University,Wuxi 214122,China;Jiangsu Provincial Key Laboratory of Food Manufacturing Equipment,Wuxi 214122,China)
出处 《系统仿真学报》 CAS CSCD 北大核心 2024年第3期743-755,共13页 Journal of System Simulation
基金 山东省重大科技创新工程基金(2019JZZY020111)。
关键词 矩形件排样 蚁群算法 一刀切 多约束 混合变异策略 layout of rectangular parts ant colony algorithm guillotine multiple constraints hybrid mutation strategy
  • 相关文献

参考文献4

二级参考文献32

  • 1龚志辉,黄星梅.二维矩形件优化排样算法的改进研究[J].湖南大学学报(自然科学版),2003,30(S1):47-49. 被引量:34
  • 2方仍存,曹炬,陈学松.矩形件排样优化的一种近似算法[J].锻压技术,2003,28(6):19-21. 被引量:8
  • 3E Hopper, B C H Turton. An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem [J]. European Journal of Operational Research (S0377-2217), 2001, 128 (1): 34-57.
  • 4Edmund K Burke, Matthew Hyde. A genetic programming hyperheuristic approach for evolving two dimensional strip packing heuristics [R]. Computer science technical report no. NOTICS- TR-2008-2. England: University of Nottingham, 2008.
  • 5Liu D, Teng H. An improved BL algorithm for genetic algorithm of the orthogonal packing of rectangles [J]. European Journal of Operational Research (S0377-2217), 1999, 112(4): 413-420.
  • 6贾志欣,殷国富,罗阳,徐雷.矩形排样的模拟退火算法求解[J].四川大学学报:工程科学版,2005,37(4):134-138.
  • 7Burke E K, Kendall G, Whitwell G. A new placement heuristic for the orthogonal stock cutting problem [J]. Operations Research: (S0030-364x), 2004, 52(4): 3270-3280.
  • 8Stephen C H Leung, Defu Zhang. A New Heuristic Approach for the Stock-Cutting Problems [M]. Italy: World Academy of Science, Engineering and Technology 53, 2009.
  • 9Jakobs Stefan. On genetic algorithms for the packing of polygons [J]. European Journal of Operational Research (S0377-2217), 1996, 88(1): 165-181.
  • 10E K Burke, G Kendall, G Whitwell. Metaheuristic enhancements of the best-fit heuristic for the orthogonal stock cutting problem [R]. Computer science technical report no. NOTTCS-TR-SUB- 0605091028-4370. England: University of Nottingham, 2006.

共引文献37

同被引文献10

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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