期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于新型蛙跳算法的带阻塞流水线调度问题 被引量：5

Blocking Flow Shop Based on a New Frog Leaping Algorithm
在线阅读 下载PDF
导出
摘要 针对目标函数为最小化Makespan的带阻塞流水线问题,提出了一种新型的蛙跳算法(New Modified Shuffled Frog Leaping Algorithm,NMSFLA)并对其求解。在蛙跳算法的局部搜索步骤中引入带约束的交叉变异思想,针对调度问题对青蛙的跳跃规则做出了改进,有效地解决了传统蛙跳算法局部搜索易出现不合法解从而导致算法效率不高的问题。仿真实验结果验证了NMSFLA解决带阻塞的Flow Shop问题的有效性。 For the blocking fl modified shuffled frog leaping al crossover method is introduced to ow shop gorithm modify t with Makespan as objective function, this paper （NMSFLA）. In the local searching of FLSA, he rule of frogs leaping. Thus, the problem that of SFLA easily generates illegal solution may be resolved. effectiveness of the proposed NMSFLA for blocking flow shop proposes a new a constrained the local search Numerical simulation results illustrate the scheduling problem.
作者 韩炜 崔喆 顾幸生
机构地区 华东理工大学化工过程控制与优化技术教育部重点实验室
出处 《华东理工大学学报（自然科学版）》 CAS CSCD 北大核心 2014年第1期86-90,共5页 Journal of East China University of Science and Technology
基金 国家自然科学基金(61174040) 中央高校基本业务费专项资金项目
关键词 蛙跳算法 FLOW SHOP 阻塞 交叉 shuffled frog leaping algorithm Flow Shop blocking crossover
分类号 TP31 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献17

  • 1Gong Hua, Tang Li-xin, Duin C W. A iwo-stage flow shopscheduling problem on a batching machine and a discretemachine with blocking and shared setup times[J]. Computersand Operations Research,2010 , 37(5) : 960-969.
  • 2Grabowski J,Pempera J. Sequencing of jobs in some produc-tion syslem[J]. European Journal of Operational Research,2000,125(3):535-550.
  • 3Wang Ling, Pan Quan-ke,Tasgetiren M F. Minimizing thetotal flow time in a flow shop with blocking by using hybridharmony search algorithms [ J ]. Expert Systems Applica-tions, 2010, 37(12); 7929-7936.
  • 4Deng Guanlong, Xu Zhenhao, Gu Xingsheng. A discrete arti-ficial bee colony algorithm for the blocking flow shop schedu-ling problem [J]. Chinese Journal of Chemical Engineering.2012, 20(6) : 1067-1073.
  • 5Hall N G, Sriskandarajah C. A survey of machine schedulingproblems with blocking and no-wait in process [J]. Opera-tions Research, 1996,44(3) : 510-525.
  • 6Ribas I,Companys R, Tort-Martorell X. An iterated greedyalgorithm for the flowshop scheduling with blocking [ J ].OMEGA, 2011, 39(3) : 293-301.
  • 7Eusuff M, Lansey K. Optimization of water distribution net-work design using the shuffled frog leaping algorithm [ J ].Journal of Water Resources Planning and Management,2003, 129(3): 210-225.
  • 8Rahimi-Vahed A. Mirzaei A H. A hybrid multi-objectiveshuffled frog-leaping algorithm for a mixed-model assemblyline sequencing problem [J]. Computers Industrial Engi-neering, 2007,53(4) : 642-666.
  • 9Chung G. Lansey K E. Application of the shuffled frog leapingalgorithm for the optimization of a general large-scale watersupply system [J]. Water Resource Management, 2003,23(4): 797-823.
  • 10Ronconi D P, Armentano A V. Lower bounding schemes forflowshops with blocking irvprocess[J]. European Journal ofOperational Research, 2001, 52(11 ): 1289-1 297.

二级参考文献25

  • 1徐震浩,顾幸生.不确定条件下的flow shop问题的免疫调度算法[J].系统工程学报,2005,20(4):374-380. 被引量：20
  • 2玄光男 程润伟.遗传算法与工程设计[M].北京:科学出版社,2000..
  • 3KUMAR S,BAGCHI T P,SRISKANDARAJAH C.Lot streaming and scheduling heuristics for m-machine no-wait flowshops[J].Computers & Industrial Engineering,2000,38(1):149-172.
  • 4EMMONS H,MATHUR K.Lot sizing in a no-wait flow shop[J].Operations Research Letters,1995,17(4):159-164.
  • 5ELBELTAGI E,HEGAZY T,GRIERSON D.Comparison among five evolutionary-based optimization algorithms[J].Advanced Engineering Informatics,2005,19(1):43-53.
  • 6RAD S F,RUIZ R,BOROOJERDIAN N.New high performing heuristics for minimizing makespan inpermutation flowshops[J].The International Journal of Management Science,2009,37(2):331-345.
  • 7MARIMULTHU S,PONNAMBALAM S G,JAWAHAR N.Evolutionary algorithms for scheduling m-machine flow shop with lot streaming[J].Robotics and Computer-Integrated Manufacturing,2008,24(1):125-139.
  • 8MARIMULTHU S,PONNAMBALAM S G,JAWAHAR N.Threshold accepting and ant-colony optimization algorithm for scheduling m-machine flow shop with lot streaming[J].Journal of Material Processing Technology,2009,209(2):1026-1041.
  • 9Garey M, Johnson D, Sethi R. The complexity of flow shop and jobshop scheduling[J]. Mathematics of Operations Research,1976,2: 117-129.
  • 10Eusuff M, Lansey K, Pasha F. Shuffled frog-leaping algorithm: A memetic meta-heuristic for discrete optimization[J]. Engineering Optimization, 2006, 38 : 129-154.

共引文献159

同被引文献44

  • 1程之刚,黎湘,庄钊文.一种基于多群体搜索的实数遗传算法[J].信号处理,2006,22(6):830-834. 被引量：2
  • 2Kumar A, Chakarverty S. Design optimization for reliable embedded system using Cuckoo Search [ C ]///Electronics Computer Technology (ICECT) , 2011 3rd International Conference on. IEEE, 2011, 1 264-268.
  • 3Readings in hardware/software co-design[ M ]. Morgan Kaufmann, 2002.
  • 4Vidal J, De Lamotte F, Gogniat G, et al. A co-design ap- proach for embedded system modeling and code generation with UML and MARTE [ C ]//Design, Automation & Test in Europe Conference & Exhibition, 2009. DATE' 09. IEEE, 2009: 226-231.
  • 5Malinowski A, Yu H. Comparison of embedded system design for industrial applications [ J ]. Industrial Infor- matics, IEEE Transactions on, 2011,7(2): 244-254.
  • 6Dick R P, Rhodes D L, Wolf W. TGFF: task graphs for free [ C ] ff Proceedings of the 6th international workshop on Hardware/software codesign. IEEE Computer Society, 1998:97-101.
  • 7Wu Jigang, Srikanthan T, Guang Chen. Algorithmic as- pects of hardware/software partitioning: 1D search algo- rithms[J]. IEEE Transactions on Computers, 2010, 59 (4) : 532-544.
  • 8王凌.量子进化算法研究进展[J].控制与决策,2008,23(12):1321-1326. 被引量：61
  • 9齐学梅,李小平,王茜.最小化总完工时间的流水作业调度混合算法[J].东南大学学报（自然科学版）,2008,38(6):960-964. 被引量：5
  • 10陈嶷瑛,李文斌,王舵,朱群英.使用面向离散搜索空间的蛙跳算法求解TSP[J].计算机工程与应用,2009,45(27):50-52. 被引量：5

引证文献5

二级引证文献14

华东理工大学学报（自然科学版）
2014年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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