期刊文献+

改进布谷鸟搜索算法求解批量流水线调度问题 被引量:2

Improved Cuckoo Search Algorithm for Lot-streaming Flow Shop Schedule Problem
下载PDF
导出
摘要 针对以最大完工时间为目标的批量流水线调度问题,提出一种改进的布谷鸟搜索算法.该算法采用排序规则的编码方式,将连续个体值的布谷鸟搜索算法直接应用于离散的调度问题.其次,在布谷鸟搜索算法的基础上,一个简单而有效的局部搜索用于批量流水线调度问题的探索.仿真实验表明所提出算法的可行性和有效性. An Improved Cuckoo Search(ICS)algorithm is presented for Lot-streaming Flow shop Scheduling Problem(LFSP)with objectives of makespan. Ordering rule is applied to enable the continuous cuckoo search algorithm to be applied to discrete scheduling problem. Then, after the CS-based exploration, a simple but efficient local search, which is designed according to the LFSP' landscape, is applied to emphasize exploitation. Simulation results show the feasibility and effectiveness of the proposed algorithms.
作者 郑洪清
出处 《计算机系统应用》 2014年第10期158-161,共4页 Computer Systems & Applications
关键词 批量流水线调度 布谷鸟搜索算法 最大完工时间 局部搜索算法 The cuckoo search algorithm Lot-streaming flow-shop scheduling Makespan Local search
  • 相关文献

参考文献11

  • 1Yoon SH, Ventura JA. An application of genetic algorithm to lot-streaming flow shop scheduling. IIE Transaction, 2002, 34(9): 779-787.
  • 2Marimuthu S, Ponnambalam SG; Jawahar N. Evolutionary algorithms for scheduling m-machine flow shops with lot-streaming. Robotics Computer-Integrated Manufacturing, 2008, 24(1): 125-139.
  • 3Marimuthu S, Pormambalam SG; Jawahar N. Threshold accepting and ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming. Journal of Materials Processing Technology, 2009, 209(2): 1026-1041.
  • 4Tseng CT, Liao CJ. A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. European Journal of Operation Research, 2008, 191(2): 360-373.
  • 5韩红燕,潘全科.求解批量流水线调度问题的改进和声搜索算法[J].计算机工程,2011,37(6):178-180. 被引量:5
  • 6王凡,贺兴时,王燕.基于高斯扰动的布谷鸟搜索算法[J].西安工程大学学报,2011,25(4):566-569. 被引量:68
  • 7Yang XS, Deb S. Engineering optimization by cuckoo search. Int J Math Modeling & Num Optimization, 2010(4):330-343.
  • 8Zheng HQ, Zhou YQ. A discrete binary version of cuckoo search for knapsack problems. Advances in Information Sciences and'Service Sciences, Oct 2012, 4(18): 331-339.
  • 9Zhou YQ, Zheng HQ. An improved cuckoo search algorithm for solving planar graph coloring problem. Applied Mathematics & Information Sciences, Appl. Math. Inf. Sci. 2013,7(2): 785-792.
  • 10Zheng HQ, Zhou YQ. A hybrid cuckoo search algorithm-GRASP for vehicle routing problem. Journal of Convergence Information Technology, 2013,8(3).

二级参考文献10

  • 1Imuthu S, Ponnambalam S G, Jawahar N. Evolutionary Algorithms for Scheduling M-machine Flow Shops with Lot Streaming[J]. Robotics Comput. Integr. Manuf., 2008, 24(1): 125-139.
  • 2Marimuthu S, Ponnambalam S G, Jawahar N. Threshold Accepling and Ant-colony Optimization Algorithms for Scheduling M-machine Flow Shops with Lot Streaming[J]. Journal of Materials Processing Technology, 2009, 209(2): 1026-1041.
  • 3Tseng Chao-Tang, Liao Ching-Jong. A Discrete Particle Swarm Optimization for Lot-streaming Flowshop Scheduling Problem[J]. European Journal of Operation Research, 2008, l 91 (2): 360-373.
  • 4Omran M G H, Mahdavi M. Global-best Harmony Search[J]. Applied Mathematics and Computation, 2008, 198(2): 643-656.
  • 5GOLDBERG D E. Genetic algorithm in search, optimization and machine learning [ M ]. Boston: Addison-Wesley Longman Publishing Co. Inc, 1989.
  • 6DORIGO M, BONABEAU E,THERAULAZ G. Ant algorithms and stigraergy [ J ]. Future Generation Computer Systems,2000, 16(8) :851-871.
  • 7KENNEDY J, EBERHART R. Particle swarm optimization [ C ]//Proc IEEE Int Conf. on Neural Networks, Australia: Perth, 1995 : 1 942-1 948.
  • 8YANG X S,DEB S. Cuckoo search via Levy flights [ C]//Proceedings of World Congress on Nature & Biologically Inspired Computing, India: IEEE Publications,2009:210-214.
  • 9YANG X S,DEB S. Engineering optimization by cuckoo search [J]. Int J Math Modeling & Num Optimization,2010(4) :330- 343.
  • 10陈晶,潘全科.求解独立任务调度的离散粒子群优化算法[J].计算机工程,2008,34(6):214-215. 被引量:9

共引文献71

同被引文献14

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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