置换流水车间调度问题的萤火虫算法求解  

Solving Permutation Flow Shop Scheduling Problem by Firefly Algorithm

作　　者：刘长平[1,2] 叶春明[1] 

机构地区：[1]上海理工大学管理学院,上海200093 [2]淮阴工学院经济管理学院,江苏淮安223001

出　　处：《工业工程与管理》2012年第3期56-59,65,共5页Industrial Engineering and Management

基　　金：教育部人文社会科学规划基金项目(10YJA630187);高校博士点专项科研基金项目(20093120110008);上海市重点学科建设资助项目(S30504);上海市教委科研创新项目(12ZS133)

摘　　要：作为新兴的仿生群智能优化算法,分析了萤火虫算法的仿生原理,对算法实现优化过程进行了定义。针对最小化最大完工时间的置换流水车间调度问题,采用基于ROV规则的随机键编码方式和互换操作的局部搜索策略,应用萤火虫算法进行求解。通过典型实例对算法进行了仿真测试,调度结果表明了萤火虫算法求解置换流水车间调度问题的可行性和有效性,优于NEH启发式算法和粒子群算法,是解决流水线生产调度问题的一种有效方法。Inspired by social behavior of fireflies and the phenomenon of bioluminescent communication, firefly algorithm （FA） was developed as a novel bionic swarm intelligence optimization method, which bionic principle of the FA was analyzed and the mechanism of optimization was defined by mathematics. Based on the code rule of randomized key representation by ranked-order value （ROV） and a swap-based local search, FA was applied to solve the minimization of makespan for permutation flow shop scheduling problem. Compared with NEH heuristic and particle swarm optimization, simulations and results for benchmark instances validate its efficiency and superiority of FA.

关 键 词：置换流水车间调度 萤火虫算法 仿生原理 最大完工时间 

分 类 号：TH18[机械工程—机械制造及自动化] TP39[自动化与计算机技术—计算机应用技术]