摘要
针对最小化最大完工时间的零空闲置换流水车间调度问题,提出了一种离散型萤火虫优化算法。基于萤火虫算法优化机理,采用基于工件序列的个体编码方式,重新定义了个体间距离的概念和位置更新公式,并结合交换、插入和逆序操作的局部搜索策略来提高算法性能。通过典型算例对算法进行了仿真测试和对比,结果表明了所提算法的可行性和有效性,扩展了传统萤火虫算法的求解范围,是解决流水线生产调度问题的一种有效方法。
A discrete firefly algorithm （DFA） is developed for solving the no-idle permutation flow shop scheduling problem （NIPFSP） with the objective of minimizing makespan. The encoding schema based on job sequence is given in the DFA, and a new distance pattern between individuals as well as location updating formula is designed. Further more, the random swap-based and insert-based along with inverse- based neighborhood strategy is embedded in order to improve the capability of local search in the proposed algorithm. Compared with other classical optimization methods, simulation results for benchmark instances show its efficiency and superiority of DFA for solving the NIPFSP.
出处
《系统管理学报》
CSSCI
2014年第5期723-727,共5页
Journal of Systems & Management
基金
国家自然科学基金资助项目(71271138
71301060)
教育部人文社会科学规划基金资助项目(13YJC630109)
上海市教委科研创新重点项目(12ZS133)
