Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems

被引:26
作者
Alfaro-Fernandez, Pedro [1 ]
Ruiz, Ruben [1 ]
Pagnozzi, Federico [2 ]
Stutzle, Thomas [2 ]
机构
[1] Univ Politecn Valencia, Grp Sistemas Optimizat Aplicada, Inst Tecnol Informat, Ciudad Politecn Innovat, Edif 8G,Acc B Camino de Vera S-N, Valencia 46021, Spain
[2] Univ Libre Bruxelles, IRIDIA, CP 194-6,Av F Roosevelt 50, B-1050 Brussels, Belgium
关键词
Scheduling; Hybrid flowshop; Automatic algorithm configuration; Automatic Algorithm Design; ITERATED GREEDY ALGORITHM; SEARCH ALGORITHM; OPTIMIZATION; PARALLEL; FLOWTIME;
D O I
10.1016/j.ejor.2019.10.004
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Industrial production scheduling problems are challenges that researchers have been trying to solve for decades. Many practical scheduling problems such as the hybrid flowshop are ATP-hard. As a result, researchers resort to metaheuristics to obtain effective and efficient solutions. The traditional design process of metaheuristics is mainly manual, often metaphor-based, biased by previous experience and prone to producing overly tailored methods that only work well on the tested problems and objectives. In this paper, we use an Automatic Algorithm Design (AAD) methodology to eliminate these limitations. AAD is capable of composing algorithms from components with minimal human intervention. We test the proposed MD for three different optimization objectives in the hybrid flowshop. Comprehensive computational and statistical testing demonstrates that automatically designed algorithms outperform specifically tailored state-of-the-art methods for the tested objectives in most cases. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:835 / 845
页数:11
相关论文
共 48 条
[1]  
[Anonymous], 2009, METAHEURISTICS DESIG
[2]  
[Anonymous], 2017, DESIGN ANAL EXPT
[3]  
Bartz-Beielstein T., 2010, EXPT METHODS ANAL OP
[4]  
Bozejko Wojciech, 2019, Contemporary Complex Systems and Their Dependability. Proceedings of the Thirteenth International Conference on Dependability and Complex Systems (DepCoS-RELCOMEX). Advances in Intelligent Systems and Computing (AISC 761), P83, DOI 10.1007/978-3-319-91446-6_9
[5]   Parallel tabu search algorithm for the hybrid flow shop problem [J].
Bozejko, Wojciech ;
Pempera, Jaroslaw ;
Smutnicki, Czeslaw .
COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 65 (03) :466-474
[6]   Grammatical Evolution of Local Search Heuristics [J].
Burke, Edmund K. ;
Hyde, Matthew R. ;
Kendall, Graham .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2012, 16 (03) :406-417
[7]   ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics [J].
Cahon, S ;
Melab, N ;
Talbi, EG .
JOURNAL OF HEURISTICS, 2004, 10 (03) :357-380
[8]   An exact method for solving the multi-processor flow-shop [J].
Carlier, J ;
Néron, E .
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2000, 34 (01) :1-25
[9]   An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem [J].
Chung, Tsui-Ping ;
Liao, Ching-Jong .
APPLIED SOFT COMPUTING, 2013, 13 (08) :3729-3736
[10]   An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems [J].
Cui, Zhe ;
Gu, Xingsheng .
NEUROCOMPUTING, 2015, 148 :248-259