期刊文献+

Sequencing of Mixed Model Assembly Lines Based on Improved Shuffled Frog Leaping Algorithm 被引量:1

Sequencing of Mixed Model Assembly Lines Based on Improved Shuffled Frog Leaping Algorithm
下载PDF
导出
摘要 Shuffled frog leaping algorithm( SFLA) was used to solve multi-objective sequencing problem of mixed model assembly line( MMAL). Local convergence can be avoided and optimal solution can be obtained to a certain extent. However,the multi-objective sequencing problem of MMAL is an non-deterministic polynomial hard( NP-hard) problem and the shortcomings are slow convergence rate and low precision. To solve the shortcomings for optimization objectives of minimizing total utility time and keeping average consumption rate of parts, a chaos differential evolution SFLA( CDESFLA) is proposed in this study. Because SFLA is easy to fall into local optimum,the evolution operator of differential evolution algorithms is introduced in SFLA as a local search strategy,and differential mutation operator is introduced in chaotic sequence to prevent premature convergence. The examples show that the proposed CDESFLA is better for convergence accuracy than SFLA,genetic algorithm( GA) and particle swarm optimization( PSO) Shuffled frog leaping algorithm( SFLA) was used to solve multi-objective sequencing problem of mixed model assembly line( MMAL). Local convergence can be avoided and optimal solution can be obtained to a certain extent. However,the multi-objective sequencing problem of MMAL is an non-deterministic polynomial hard( NP-hard) problem and the shortcomings are slow convergence rate and low precision. To solve the shortcomings for optimization objectives of minimizing total utility time and keeping average consumption rate of parts, a chaos differential evolution SFLA( CDESFLA) is proposed in this study. Because SFLA is easy to fall into local optimum,the evolution operator of differential evolution algorithms is introduced in SFLA as a local search strategy,and differential mutation operator is introduced in chaotic sequence to prevent premature convergence. The examples show that the proposed CDESFLA is better for convergence accuracy than SFLA,genetic algorithm( GA) and particle swarm optimization( PSO).
作者 赵小强 季树荣 ZHAO Xiaoqiang;JI Shurong(College of Electrical and Information Engineering, Lanzhou University of Technology, Lanzhou 730050, China;Key Laboratory of Advanced Control of Industrial Process in Gansu Province, Lanzhou 730050, China;National Experimental Teaching Center for Electrical and Control Engineering of Lanzhou University of Technology, Lanzhou 730050, China)
出处 《Journal of Donghua University(English Edition)》 EI CAS 2018年第2期154-159,共6页 东华大学学报(英文版)
基金 National Natural Science Foundation of China(o.61370037)
关键词 MIXED model ASSEMBLY LINE (MMAL) SEQUENCING shuffledfrog leaping ALGORITHM (SFLA) CHAOS optimization differentialevolution ALGORITHM mixed model assembly line (MMAL) sequencing shuffledfrog leaping algorithm (SFLA) chaos optimization differentialevolution algorithm
  • 相关文献

参考文献3

二级参考文献48

  • 1鞠全勇,朱剑英.基于混合遗传算法的动态车间调度系统的研究[J].中国机械工程,2007,18(1):40-43. 被引量:24
  • 2FRY T D, OLIFF M D, MINOR E D, et al. The effect of product structure and sequencing rule on assembly shop performance[J]. International Journal of Production Research, 1989, 27(4): 671-686.
  • 3HUAN P Y. A comparative study of priority dispatching roles in a hybrid assembly/job shop[J]. International Journal of Production Research, 1984, 22(3): 375-387.
  • 4PHILIPOON P R, RUSSEL R S, FRY T D. A preliminary investigation of multi-attribute based sequencing rules for assembly shops[J]. International Journal of Production Research, 1991, 29(4): 739-753.
  • 5DOCTOR S R, CAVALIER T M, EGBELU P J. Scheduling for machining and assembly in a job-shop environment[J]. International Journal of Production Research, 1993, 31(6): 1 275-1 297.
  • 6MCKOY D H C, EGBELU P J. Minimizing production flow time in a process and assembly job shop[J]. International Journal of Production Research 1998 31(8): 2 315-2 332.
  • 7CHENG T C E. Analysis of material flow in a job shop with assembly operations[J]. International Journal of Production Research, 1990, 28(7): 1 369-1 383.
  • 8THIAGARAJAN S, RAJENDRAN C. Scheduling in dynamic assembly job-shops having different holding and tardiness costs[J]. International Journal of Production Research, 2003, 41(18): 4 453- 4 486.
  • 9THIAGARAJAN S, RAJENDRAN C. Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs[J]. Computers and Industrial Engineering, 2005, 49(4): 463-503.
  • 10GAAFAR L K, MASOUD S A. Genetic algorithms and simulated annealing for scheduling in agile manufacturing[J]. International Journal of Production Research, 2005, 43(14): 3 069-3 085.

共引文献39

同被引文献7

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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