A Random Key based Estimation of Distribution Algorithm for the Permutation Flowshop Scheduling Problem

Random Key (RK) is an alternative representation for permutation problems that enables application of techniques generally used for continuous optimisation. Although the benefit of RKs to permutation optimisation has been shown, its use within Estimation of Distribution Algorithms (EDAs) has been a challenge. Recent research proposing a RK-based EDA (RK-EDA) has shown that RKs can produce competitive results with state of the art algorithms. Following promising results on the Permutation Flowshop Scheduling Problem, this paper presents an analysis of RK-EDA for optimising the total flow time. Experiments show that RK-EDA outperforms other permutation-based EDAs on instances of large dimensions. The difference in performance between RK-EDA and the state of the art algorithms also decreases when the problem difficulty increases.

[1]  Alexander Mendiburu,et al.  Extending distance-based ranking models in estimation of distribution algorithms , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[2]  Alexander Mendiburu,et al.  The Plackett-Luce ranking model on permutation-based optimization problems , 2013, 2013 IEEE Congress on Evolutionary Computation.

[3]  John A. W. McCall,et al.  RK-EDA: A Novel Random Key Based Estimation of Distribution Algorithm , 2016, PPSN.

[4]  Alfredo Milani,et al.  Algebraic Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem With Total Flowtime Criterion , 2016, IEEE Transactions on Evolutionary Computation.

[5]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[6]  Alexander Mendiburu,et al.  A Distance-Based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem , 2014, IEEE Transactions on Evolutionary Computation.

[7]  Shigeyoshi Tsutsui,et al.  Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram , 2002, PPSN.

[8]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[9]  Martin Pelikan,et al.  Dependency trees, permutations, and quadratic assignment problem , 2007, GECCO '07.

[10]  Xiao Xu,et al.  An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization , 2011, Expert Syst. Appl..

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

[12]  Alexander Mendiburu,et al.  A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems , 2012, Progress in Artificial Intelligence.

[13]  Marco César Goldbarg,et al.  New VNS heuristic for total flowtime flowshop scheduling problem , 2012, Expert Syst. Appl..

[14]  Martin Pelikan,et al.  An introduction and survey of estimation of distribution algorithms , 2011, Swarm Evol. Comput..

[15]  Pedro Larrañaga,et al.  Triangulation of Bayesian networks with recursive estimation of distribution algorithms , 2009, Int. J. Approx. Reason..

[16]  Alexander Mendiburu,et al.  Kernels of Mallows Models for Solving Permutation-based Problems , 2015, GECCO.

[17]  Quan-Ke Pan,et al.  Local search methods for the flowshop scheduling problem with flowtime minimization , 2012, Eur. J. Oper. Res..

[18]  David E. Goldberg,et al.  Node Histogram vs . Edge Histogram : A Comparison of PMBGAs in Permutation Domains , 2006 .

[19]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[20]  M. Fligner,et al.  Multistage Ranking Models , 1988 .

[21]  Alfredo Milani,et al.  A Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion , 2014, PPSN.

[22]  Dirk Thierens,et al.  Crossing the road to efficient IDEAs for permutation problems , 2001 .

[23]  John A. W. McCall,et al.  Factoradic Representation for Permutation Optimisation , 2014, PPSN.