Multi-armed Bandit Based Hyper-Heuristics for the Permutation Flow Shop Problem

In this work, we propose MAB variants as selection mechanisms of a hyper-heuristic running on the multi-objective framework named MOEA/D-DRA to solve the Permutation Flow Shop Problem (PFSP). All the variants are designed to choose which of low-level heuristic components (for crossover and mutation operators) should be applied to each solution during execution. FRRMAB is the classical MAB, RMAB is restless and LinUCB is contextual (its context is based on side information). The proposed approaches are compared with each other and the best one, MOEA/D-LinUCB, is compared with MOEA/DDRA using the hypervolume indicator and nonparametric statistical tests. The results demonstrate the robustness of MAB-based approaches, especially the contextual-based one.

[1]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[2]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[3]  Alexander Mendiburu,et al.  A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms , 2015, Comput. Optim. Appl..

[4]  Wei Chu,et al.  A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.

[5]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[6]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[7]  Qingfu Zhang,et al.  The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances , 2009, 2009 IEEE Congress on Evolutionary Computation.

[8]  Li Zhou,et al.  A Survey on Contextual Multi-armed Bandits , 2015, ArXiv.

[9]  Carolina P. de Almeida,et al.  A New Hyper-Heuristic Based on a Contextual Multi-Armed Bandit for Many-Objective Optimization , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[10]  Qingfu Zhang,et al.  An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition , 2015, IEEE Transactions on Evolutionary Computation.

[11]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[12]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[13]  Qing Zhao,et al.  Learning and sharing in a changing world: Non-Bayesian restless bandit with multiple players , 2011, 2011 Information Theory and Applications Workshop.

[14]  Sébastien Bubeck,et al.  Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..

[15]  Aurora Trinidad Ramirez Pozo,et al.  A New Hyper-Heuristic Based on a Restless Multi-armed Bandit for Multi-objective Optimization , 2017, 2017 Brazilian Conference on Intelligent Systems (BRACIS).

[16]  Mehmet Mutlu Yenisey,et al.  Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends , 2014 .

[17]  Demosthenis Teneketzis,et al.  Multi-Armed Bandit Problems , 2008 .

[18]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[19]  Qingfu Zhang,et al.  Adaptive Operator Selection With Bandits for a Multiobjective Evolutionary Algorithm Based on Decomposition , 2014, IEEE Transactions on Evolutionary Computation.

[20]  Aurora Trinidad Ramirez Pozo,et al.  Multiobjective decomposition-based Mallows Models estimation of distribution algorithm. A case of study for permutation flowshop scheduling problem , 2017, Inf. Sci..

[21]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[22]  Thomas Stützle,et al.  Deconstructing Multi-objective Evolutionary Algorithms: An Iterative Analysis on the Permutation Flow-Shop Problem , 2014, LION.