A Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion

In this paper a new discrete Differential Evolution algorithm for the Permutation Flowshop Scheduling Problem with the total flowtime criterion is proposed. The core of the algorithm is the distance-based differential mutation operator defined by means of a new randomized bubble sort algorithm. This mutation scheme allows the Differential Evolution to directly navigate the permutations search space. Experiments were held on a well known benchmark suite and the results show that our proposal outperforms state-of-the-art algorithms on the majority of the problems.

[1]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

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

[3]  Janez Brest,et al.  Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems , 2006, IEEE Transactions on Evolutionary Computation.

[4]  Thomas Stützle,et al.  A review of metrics on permutations for search landscape analysis , 2007, Comput. Oper. Res..

[5]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

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

[7]  Xiangtao Li,et al.  An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure , 2013, Adv. Eng. Softw..

[8]  Zuzana Čičková,et al.  Flow Shop Scheduling using Differential Evolution , .

[9]  Alfredo Milani,et al.  Experimental evaluation of pheromone models in ACOPlan , 2011, Annals of Mathematics and Artificial Intelligence.

[10]  Godfrey C. Onwubolu,et al.  Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization , 2009 .

[11]  Riccardo Poli,et al.  Geometric crossover for the permutation representation , 2011, Intelligenza Artificiale.

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

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

[14]  Alfredo Milani,et al.  Community of scientist optimization: An autonomy oriented approach to distributed optimization , 2012, AI Commun..

[15]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[16]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[17]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[18]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..