工业工程 ›› 2013, Vol. 16 ›› Issue (1): 119-124.

• 专题论述 • 上一篇    下一篇

蝙蝠算法在PFSP调度问题中的应用研究

  

  1. (上海理工大学 管理学院, 上海 200093)
  • 出版日期:2013-02-28 发布日期:2013-03-22
  • 作者简介:盛晓华(1987-),男,山东省人,硕士研究生,主要研究方向为工业工程.
  • 基金资助:

    教育部人文社会科学规划基金项目(10YJA630187);高等学校博士点基金资助项目(20092020);上海市重点学科建设资助项目(S30504)

Application of Bat Algorithm to Permutation Flow-Shop Scheduling Problem

  1. (College of Management, University of Shanghai for Science & Technology, Shanghai 200093,China)
  • Online:2013-02-28 Published:2013-03-22

摘要: 针对新生的启发式智能算法蝙蝠算法求解离散型生产调度问题存在的局限性,利用对蝙蝠算法重新编码以及初始化的方式来求解离散型生产调度问题。通过对经典的生产调度基准数据进行测试,并同较成熟的标准粒子群算法进行比较。结果表明,蝙蝠算法在解决离散的生产调度问题时,具有较好的优化性能。验证了蝙蝠算法求解离散性问题的有效性以及可行性。

关键词: 蝙蝠算法, ROV编码, NEH初始化, 置换流水车间调度, 粒子群算法

Abstract: Permutation flow-shop scheduling problem (PFSP) is a typical combinatorial optimization problem. It is known that the existing bat algorithm is not suitable for solving discrete problems. To overcome this drawback, a new bat algorithm is proposed by modifying its code design and initialization. Then, the proposed algorithm is applied to the PFSP. The proposed method is tested by using classic scheduling benchmark problems and compared with standard particle swarm algorithm and quantum particle swarm algorithm. Simulation results show that the proposed algorithm outperforms the others.

Key words: bat algorithm, ranked order ralue(ROV) coding;Nawaz-Enscore-Ham (NEH) initialization, permutation flow shop scheduling, particle swarm algorithm