Flexible Job Shop Scheduling Multi-objective Optimization Based on Improved Strength Pareto Evolutionary Algorithm

被引:3
|
作者
Wei, Wei [2 ]
Feng, Yixiong [1 ]
Tan, Jianrong [1 ]
Hagiwara, Ichiro [3 ]
机构
[1] Zhejiang Univ, State Key Lab Fluid Power Transmiss & Control, Hangzhou 310003, Zhejiang, Peoples R China
[2] Beihang Univ, Sch Mfg Engn & Automat, Adv Mfg Technol & Syst Res Ctr, Beijing 100191, Peoples R China
[3] Tokyo Inst Technol, Dept Mech Sci & Engn, Tokyo 1528550, Japan
基金
中国国家自然科学基金;
关键词
Flexible job shop scheduling; Multi-objective optimization; SPEA2+; Genetic algorithm;
D O I
10.4028/www.scientific.net/AMR.186.546
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Scheduling for the flexible job shop is very important in fields of production management. To solve the multi objective optimization in flexible job shop scheduling problem (FJSP), the FJSP multi-objective optimization model is constructed. The cost, quality and time are taken as the optimization objectives. An improved strength Pareto evolutionary algorithm (SPEA2+) is put forward to optimize the multi-objective optimization model parallelly. The algorithm uses a new model of a Multi-objective genetic algorithm that includes more effective crossover and could obtain diverse solutions in the objective and variable spaces to archive the Pareto optimal sets for FJSP multi-objective optimization. Then an approach based on fuzzy set theory was developed to extract one of the Pareto-optimal solutions as the best compromise one. The optimization results were compared with those obtained by NSGA-II and POS. At last, an instance of flexible job shop scheduling problem in automotive industry is given to illustrate that the proposed method can solve the multi-objective FJSP effectively.
引用
收藏
页码:546 / +
页数:2
相关论文
共 50 条
  • [21] Multi-objective Job Shop Scheduling Based on Hybrid Evolutionary Algorithm and Knowledge
    Qiu Y.
    Ji W.
    Zhang C.
    Zhongguo Jixie Gongcheng/China Mechanical Engineering, 2020, 31 (24): : 2979 - 2987
  • [22] A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem
    Wang, Ling
    Wang, Shengyao
    Liu, Min
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (12) : 3574 - 3592
  • [23] Evolutionary algorithms for multi-objective flexible job shop cell scheduling
    Deliktas, Derya
    Ozcan, Ender
    Ustun, Ozden
    Torkul, Orhan
    APPLIED SOFT COMPUTING, 2021, 113
  • [24] An Improved Genetic Algorithm for Multi-objective Flexible Job-shop Scheduling Problem
    Zhang, Chaoyong
    Wang, Xiaojuan
    Gao, Liang
    MANUFACTURING SCIENCE AND ENGINEERING, PTS 1-5, 2010, 97-101 : 2449 - 2454
  • [25] An Improved Ant Colony Algorithm for Multi-objective Flexible Job Shop Scheduling Problem
    Li, Li
    Wang, Keqi
    2009 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS ( ICAL 2009), VOLS 1-3, 2009, : 697 - +
  • [26] Research on Multi-objective Green Flexible Job-shop Scheduling Based on Improved ABC Algorithm
    Li Y.
    Huang W.
    Wu R.
    Wu, Rui (wurui@whut.edu.cn), 1600, China Mechanical Engineering Magazine Office (31): : 1344 - 1350and1385
  • [27] A Knee-Point Driven Multi-objective Evolutionary Algorithm for Flexible Job Shop Scheduling
    Li, Wenhua
    Zhang, Tao
    Wang, Rui
    Wang, Bo
    Song, Yuanming
    Li, Xunjia
    2019 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2019), 2019, : 1716 - 1722
  • [28] Multi-objective flexible job shop scheduling problem using variable neighborhood evolutionary algorithm
    Wang, Chun
    Ji, Zhicheng
    Wang, Yan
    MODERN PHYSICS LETTERS B, 2017, 31 (19-21):
  • [29] Multi-objective pareto optimization on flexible job-shop scheduling problem about due punishment
    Zhengzhou Institute of Aeronautical Industry Management, Zhengzhou 450015, China
    不详
    不详
    Jixie Gongcheng Xuebao, 1600, 12 (184-192):
  • [30] A Pareto archive particle swarm optimization for multi-objective job shop scheduling
    Lei, Deming
    COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (04) : 960 - 971