Parameter settings and representations in Pareto-based optimization for job shop scheduling

被引:8
|
作者
Esquivel, SC [1 ]
Ferrero, SW [1 ]
Gallard, RH [1 ]
机构
[1] Univ Nacl San Luis, Dept Informat, Lab Invest & Desarrollo Inteligencia Computac, RA-5700 San Luis, Argentina
关键词
D O I
10.1080/01969720290040759
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A multiobjective optimization problem involves multiple objectives, often conflicting, to be met or optimized. A Pareto front provides a set of best solutions to determine the trade-offs between the various objectives. New evolutionary approaches demonstrated its ability to build well-delineated Pareto fronts in diverse multiobjective optimization problems, including multicriteria optimization in job shop scheduling with regular and nonregular objective functions. Good parameter settings and appropriate representations can enhance the behavior of an evolutionary algorithm. The present article shows a study of the influence of distinct parameter combinations as well as different chromosome representations. Details of implementation and results are discussed.
引用
收藏
页码:559 / 578
页数:20
相关论文
共 50 条
  • [1] Pareto-based discrete harmony search algorithm for flexible job shop scheduling
    Gao, K. Z.
    Suganthan, P. N.
    Chua, T. J.
    2012 12TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA), 2012, : 953 - 956
  • [2] A hybrid Pareto-based local search for multi-objective flexible job shop scheduling problem
    Li, Junqing
    Pan, Quanke
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [3] 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
  • [4] A Hybrid Pareto-Based Tabu Search for the Distributed Flexible Job Shop Scheduling Problem With E/T Criteria
    Li, Jun-Qiang
    Duan, Peiyong
    Cao, Jinde
    Lin, Xiao-Ping
    Han, Yu-Yan
    IEEE ACCESS, 2018, 6 : 58883 - 58897
  • [5] A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems
    Li, Jun-Qing
    Pan, Quan-Ke
    Chen, Jing
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (04) : 1063 - 1078
  • [6] Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
    Gao, K. Z.
    Suganthan, P. N.
    Pan, Q. K.
    Chua, T. J.
    Cai, T. X.
    Chong, C. S.
    INFORMATION SCIENCES, 2014, 289 : 76 - 90
  • [7] Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems
    Li, Jun-Qing
    Pan, Quan-Ke
    Gao, Kai-Zhou
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 55 (9-12): : 1159 - 1169
  • [8] An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling
    Wang, Ling
    Zhou, Gang
    Xu, Ye
    Liu, Min
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 60 (9-12): : 1111 - 1123
  • [9] An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling
    Ling Wang
    Gang Zhou
    Ye Xu
    Min Liu
    The International Journal of Advanced Manufacturing Technology, 2012, 60 : 1111 - 1123
  • [10] Hybrid Pareto-based tabu search algorithm for solving the multi-objective flexible Job Shop scheduling problem
    Li, Jun-Qing
    Pan, Quan-Ke
    Wang, Yu-Ting
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2010, 16 (07): : 1419 - 1426