基于CGA算法的装配车间物流缓存区布局优化方法  

Optimization Method of Logistics Buffer Area Layout in Assembly Workshop Based on CGA Algorithm

作　　者：柏孟韬 李丰 滕继东 黄大巍 BAI Meng-tao;LI Feng;TENG Ji-dong;HUANG Da-wei(GAC Mitsubishi Motors Co.,Ltd.,Changsha 410100 China;Mmi Planning&Engineering Institute Ix Co.,Ltd.,Changchun 130011 China)

机构地区：[1]广汽三菱汽车有限公司,湖南长沙410100 [2]机械工业第九设计研究院股份有限公司,吉林长春130011

出　　处：《自动化技术与应用》2023年第10期24-27,80,共5页Techniques of Automation and Applications

摘　　要：针对当前已有方法未能考虑最小物料搬运矩问题,导致物流缓存区布局优化方案不理想,产品产量下降,提出一种基于共轭梯度算法(Conjugate Gradient Algorithm,CGA)的装配车间物流缓存区布局优化方法,将装配车间最小物料搬运矩和最大缓存区不同作业车间邻接关联度作为目标,构建物流缓存区布局模型。引入云模型,采用CGA算法对模型进行求解,快速获取最佳布局方案,实现布局优化。测试结果表明方法不仅可以有效提升装配车间的产品产量,同时还能够获取更加满意的装配车间物流缓存区布局优化方案。The existing methods fail to consider the minimum material handling moment,which leads to the unsatisfactory layout optimization scheme of logistics buffer area and the decline of product output.A logistics buffer layout optimization method based on Conjugate Gradient Algorithm(CGA)algorithm is proposed.The logistics buffer layout model is constructed by taking the minimum material handling moment and the adjacency correlation degree of different workshops in the maximum buffer area as the objectives.The cloud model is introduced,and the CGA algorithm is used to solve the model to quickly obtain the best layout scheme and realize layout optimization.The test results show that the method can not only effectively improve the product output of the assembly workshop,but also obtain a more satisfactory layout optimization scheme of the logistics buffer area of the assembly workshop.

关 键 词：CGA算法 装配车间 物流缓存区 布局优化 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置] F406.2[自动化与计算机技术—控制科学与工程]