期刊文献+

离散微粒群算法求解批量流水线调度问题 被引量:1

Discrete particle swarm optimization algorithm for lot-streaming flow shop problem
下载PDF
导出
摘要 提出了解决批量流水线调度问题的离散微粒群优化算法。该算法采用了基于工序的编码方式,设计了新的粒子生成公式,从而使微粒群算法可以直接应用于调度问题。同时,针对微粒群算法容易陷入局部最优的缺陷,将其与模拟退火算法结合,得到了改进的微粒群优化算法。仿真实验表明了上述算法的有效性。 A Discrete Particle Swarm Optimization(DPSO) algorithm is presented for the Lot-streaming Flow Shop Problem(LFSP). The natural encoding scheme based on job permutation and newly designed methods are adopted to produce new individual.This makes PSO more suitable for scheduling problems.Pure PSO may produce premature and poor results.Improved PSO is put forward by combining the PSO and SA.Simulation results show the effectiveness of the above algorithms.
出处 《计算机工程与应用》 CSCD 北大核心 2010年第6期52-55,共4页 Computer Engineering and Applications
基金 国家自然科学基金(No.60874075 No.70871065)~~
关键词 批量流水线调度 微粒群算法 模拟退火算法 lot-streaming flow shop particle swarm optimization algorithm simulated annealing algorithm
  • 相关文献

参考文献7

  • 1Kalir A A.Optimal and heuristic solutions for the single and multiple batch flow shop lot streaming problems with equal sublots[J]. Decision Sciences, 2007,32(2) : 387-398.
  • 2Kropp D H,Smunt T L.Optimal and heuristic models for lot splitting in a flow shop[J].Decision Sciences,1990,21:691-709.
  • 3Tseng C T,Liao C J.A discrete particle swarm optimization for lot-streaming flowshop scheduling problem[J].European Journal of Operational Research,2007(8).
  • 4Yoon S H,Ventura J A.An application of genetic algorithms to lot-straming flow shop scheduling[J].IIE Transactions, 2002,34 : 779-787.
  • 5Trietsch D,Baker K R.Basic techniques for lot streaming [J].Operations Research, 1993,41 : 1065-1076.
  • 6Pan Q K,Wang L.No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm[J].International Journal of Advanced Manufacturing Technology,2007: 796-807.
  • 7潘全科,朱剑英.基于进化算法和模拟退火算法的混合调度算法[J].机械工程学报,2005,41(6):224-227. 被引量:21

二级参考文献7

  • 1Chu C, Proth J M, Wang C. Improving job-shop schedules through critical pairwise exchanges. International Journal of Production Research, 1998, 36(3): 683-694.
  • 2Nowicki E, Smutnicki C. A fast taboo search algorithm for the job shop scheduling. Management Science, 1996, 42(6):797-813.
  • 3Shi G Y. A genetic algorithm applied to a classic job-shop scheduling problem. International Journal of Systems Science, 1997, 28(1): 25-32.
  • 4Laarhoven P V, Aarts E, Lenstra J K. Job shop scheduling by simulated anncaling. Operations Research, 1992, 40:113-125.
  • 5Corce F D, Tadei R, Volta G. A genetic algorithm for the job shop problem. Computers and Operations Research, 1995,22:15-24.
  • 6Amico M D, Trubian M. Applying tabu search to the job shop scheduling problems. Annual Operations Research,1993, 40:231-252.
  • 7王凌,郑大钟.Meta-heuristic算法研究进展[J].控制与决策,2000,15(3):257-262. 被引量:22

共引文献20

同被引文献3

引证文献1

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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