期刊文献+

基于SLP和粒子群算法的车间布局优化研究 被引量:11

Research on Layout Optimization of SY Company Based on SLP and Particle Swarm Algorithm
下载PDF
导出
摘要 当前社会经济下行风险增加,企业面临提升核心竞争力的压力与挑战,合理的车间布局,能减少企业在制品库存,提高空间利用率,降低生产成本。在传统SLP方法的基础上,对车间物流相互关系和非物流相互关系进行系统分析,并构建了物料搬运成本最小和非物流关系密切程度最大的多目标规划模型,结合粒子群算法,得出优化布局方案。通过实际应用案例,验证了优化方案的有效性。结果表明通过SLP和粒子群算法结合能有效解决车间布局优化问题,为企业解决布局问题提供参考。 With the increasing of economic downturn risk,enterprises are facing the pressure and challenges to improve their core competitiveness.Rational workshop layout can reduce work-in-process inventory,improve space utilization and reduce production costs.The relationship between workshop logistics and non-logistics was systematically analyzed base on the traditional SLP method,a multi-objective programming model with minimum material handling cost and maximum non-logistics relationship was constructed.The model was solved to obtain the optimal layout scheme by particle swarm optimization algorithm,the effectiveness of the optimization solution was verified by practical application cases.The results show that the combination of SLP and particle swarm algorithm can effectively solve the problem of workshop layout optimization,which can provide reference for enterprise.
作者 徐晓鸣 邓裕琪 吴绮萍 XU Xiaoming;DENG Yuqi;WU Qiping(School of Mechanical and Power Engineering,Guangdong Ocean University,Zhanjiang,Guangdong 524088,China;Shenzhen SUNYILG Intelligent Equipment Co.,Ltd.,Shenzhen,Guangdong 518106,China)
出处 《机电工程技术》 2020年第2期17-20,98,共5页 Mechanical & Electrical Engineering Technology
基金 广东省教育厅青年创新人才类项目(编号:2016KQNCX059).
关键词 车间布局 系统布置方法 粒子群算法 布局优化 workshop layout systematic layout planning particle swarm algorithm layout optimization
  • 相关文献

参考文献3

二级参考文献32

  • 1应保胜,张华,杨少华.敏捷制造车间布局优化的启发式算法[J].计算机集成制造系统,2004,10(8):962-965. 被引量:12
  • 2何大阔,王福利,贾明兴.遗传算法初始种群与操作参数的均匀设计[J].东北大学学报(自然科学版),2005,26(9):828-831. 被引量:59
  • 3Braglia M,Zanon S,Zavanella L.Layout design in dynamic environments:Strategies and quantitative indices[J].INT J PROD RES,2003,41(5):995-1016.
  • 4GAREY M R, JOHNSON D S. Computers and intractability: a guide to the theory of NP-completeness[M]. New York, N. Y. , USA:W. H. Freeman and Company, 1979.
  • 5GILMORE P C. Optimal and suboptimal algorithms for the quadratic assignment problem[J]. Journal of the Society for Industrial and Applied Mathematics, 1962,10(2) : 305-313.
  • 6LAWLER E L. The quadratic assignment problem[J]. Man- agement Science, 1963,9(4) : 586-599.
  • 7BAZARAA M S, SHERALI H D. On the use of exact and heuristic cutting plane methods for the quadratic assignment problem[J]. Journal of Operations Research Society, 1982,33 (1) :991-1003.
  • 8OSSAMA K, MUHITTIN O. Reformulating quadratic assign- ment problems for efficient optimization[J], liE Transactions, 1993,25(6):97-107.
  • 9TAM K Y. A simulated annealing algorithm for allocation space to manufacturing cells[J]. International Journal of Production Research, 1992,30 (1) : 63-87.
  • 10TATE D M, SMITH A E. Unequal area facility layout using genetic search[J]. IIE Transactions,1995,27(4):465-472.

共引文献76

同被引文献81

引证文献11

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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