期刊文献+

柔性车间内AGV最优替换比研究 被引量:1

Research on optimal replacement ratio of AGV in flexible workshops
下载PDF
导出
摘要 针对柔性车间内AGV最优替换比问题,建立了员工、AGV共同搬运的柔性车间调度模型。该模型以完工时间最小、成本最少为目标,从静态分析与动态分析两方面求得最优替换比。静态分析部分主要采用线性规划完成,动态分析部分采用粒子群算法进行求解。针对动态分析部分,提出启发式规则分配AGV、员工搬运操作。通过算例得出AGV最优替换比的帕累托最优解集。并发现AGV最优替换比和AGV价格有关。 In order to solve the problem of optimal replacement ratio of AGVs in flexible workshops,this paper established a flexible workshop scheduling model for employees and AGVs.This model took the minimum completion time and cost as the goal and obtained the optimal replacement ratio from static analysis and dynamic analysis.The static analysis part mainly used the linear programming to complete,the dynamic analysis part used the particle swarm algorithm to solve.For the dynamic analysis part,this paper proposed heuristic rules to allocate AGVs and employee handling operations.Through experiments,this paper obtains the Pareto optimal solution set of optimal replacement ratio of AGV.And this paper finds that AGV optimal replacement ratio is related to AGV price.
作者 徐云琴 叶春明 曹磊 Xu Yunqin;Ye Chunming;Cao Lei(School of Business,University of Shanghai for Science&Technology,Shanghai 200093,China)
出处 《计算机应用研究》 CSCD 北大核心 2019年第11期3338-3343,共6页 Application Research of Computers
基金 国家自然科学基金资助项目(71271138) 上海理工大学科技发展项目(16KJFZ028) 上海市高原学科项目(GYXK1201)
关键词 FJSP AGV 粒子群算法 替换比 FJSP AGV particle swarm algorithm replacement ratio
  • 相关文献

参考文献5

二级参考文献40

  • 1潘全科,王文宏,朱剑英,赵保华.基于粒子群优化和变邻域搜索的混合调度算法[J].计算机集成制造系统,2007,13(2):323-328. 被引量:43
  • 2张超勇,饶运清,李培根,邵新宇.柔性作业车间调度问题的两级遗传算法[J].机械工程学报,2007,43(4):119-124. 被引量:105
  • 3Xia W J,Wu Z M.An effective hybrid optimizationapproach for multi-objective flexible job-shop schedulingproblems[J].Computers and Industrial Engineering,2005,48(2):409-425.
  • 4Yazdani M,Amiri M,Zandieh M.Flexible jobshopscheduling with parallel variable neighborhood searchalgorithm[J].Expert Systems with Applications,2010,37(1):678-687.
  • 5Pezzella F,Morganti G,Ciaschetti G.A genetic algorithmfor the flexible job-shop scheduling problem[J].Computersand Operations Research,2008,35(10):3202-3212.
  • 6Zhao Y W,Wang H Y,Xu X L,et al.A new hybridparallel algorithm for consistent-sized batch splitting jobshop scheduling on alternative machines with forbiddenintervals[J].Int J of Advanced Manufacturing Technology,2010,48(9):1091-1105.
  • 7Kennedy J,Eberhart R.Particle swarm optimization[C].Proc of IEEE Int Conf on Neural Networks.Piscataway,1995:1942-1948.
  • 8Shi G Y.A genetic algorithm applied to a classic job shopscheduling problem[J].Int J of Systems Science,1997,28(1):25-32.
  • 9Noureddine L,Ihsen S,Slim H.Ant systems and localsearch optimization for flexible job shop schedulingproduction[J].Int J of Computers Communications andControl,2007,2(2):174-184.
  • 10Kacem I,Hammadi S,Borne P.Approach by localizationand multi-objective evolutionary optimization for flexiblejob shop scheduling problems[J].IEEE Trans on Systems,Man and Cybernetics,Part C:Applications and Reviews,2002,32(1):1-13.

共引文献63

同被引文献6

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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