中国机械工程 ›› 2015, Vol. 26 ›› Issue (3): 348-353,360.

• 智能制造 • 上一篇    下一篇

多目标置换流水车间调度的改进食物链算法

陈可嘉;周晓敏   

  1. 福州大学,福州,350108
  • 出版日期:2015-02-10 发布日期:2015-02-09
  • 基金资助:
    国家自然科学基金资助项目(70901021,71201033);教育部新世纪优秀人才支持计划资助项目(NCET-11-0903) 

Improved Food Chain Algorithm for Multi-objective Permutation Flow Shop Scheduling

Chen Kejia;Zhou Xiaomin   

  1. Fuzhou University,Fuzhou,350108
  • Online:2015-02-10 Published:2015-02-09
  • Supported by:
    National Natural Science Foundation of China(No. 70901021,71201033);Program for New Century Excellent Talents in University of Ministry of Education of China(No. NCET-11-0903)

摘要:

针对目标函数为最小化最大完成时间和总延迟时间的多目标置换流水车间调度问题,提出了一种改进的食物链算法。该算法在食物链算法的基础上,引入基于Pareto最优解的快速非支配性排序和个体拥挤距离计算,增强了算法的寻优性能。对OR-Library三个典型算例的优化比较表明,该算法在解的质量上明显超越NSGA-Ⅱ算法。

关键词: 置换流水车间调度, 多目标优化, 食物链算法, Pareto最优解

Abstract:

An improved food chain algorithm was proposed for permutation flow shop scheduling with multiple objectives of minimizing makespan and total tardiness. Fast non-dominated sorting and crowded distance estimation were introduced into the food chain algorithm to improve the optimization ability based on Pareto optimal solutions. Three typical OR-Library examples were selected to conduct comparison. Numerical results show that the designed algorithm can obtain much better solutions than NSGA-Ⅱ.

Key words: permutation flow shop scheduling, multi-objective optimization, food chain algorithm, Pareto optimal solution

中图分类号: