A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems

Job shop scheduling problem (JSSP) is a typical NP-hard problem. In order to improve the solving efficiency for JSSP, a hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search is proposed in this paper, which combines the merits of Estimation of distribution algorithm and Differential evolution (DE). Meanwhile, to strengthen the searching ability of the proposed algorithm, a chaotic strategy is introduced to update the parameters of DE. Two mutation operators are adopted. A neighbourhood search (NS) algorithm based on blocks on critical path is used to further improve the solution quality. Finally, the parametric sensitivity of the proposed algorithm has been analysed based on the Taguchi method of design of experiment. The proposed algorithm was tested through a set of typical benchmark problems of JSSP. The results demonstrated the effectiveness of the proposed algorithm for solving JSSP.

[1]  Daecheol Kim,et al.  Ant colony optimisation with parameterised search space for the job shop scheduling problem , 2010 .

[2]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[3]  Laxmi Srivastava,et al.  Modified Differential Evolution algorithm for multi-objective VAR management , 2014 .

[4]  Jianchao Zeng,et al.  An Efficient Estimation of Distribution Algorithm for Job Shop Scheduling Problem , 2010, SEMCCO.

[5]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[6]  Yuping Wang,et al.  A new hybrid genetic algorithm for job shop scheduling problem , 2012, Comput. Oper. Res..

[7]  Carlos A. Coello Coello,et al.  Use of an Artificial Immune System for Job Shop Scheduling , 2003, ICARIS.

[8]  Fuqing Zhao,et al.  A chemotaxis-enhanced bacterial foraging algorithm and its application in job shop scheduling problem , 2015, Int. J. Comput. Integr. Manuf..

[9]  Maghsud Solimanpur,et al.  A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts , 2011, Comput. Ind. Eng..

[10]  Beatrice M. Ombuki-Berman,et al.  Local Search Genetic Algorithms for the Job Shop Scheduling Problem , 2004, Applied Intelligence.

[11]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[12]  Lei Wang,et al.  An improved adaptive genetic algorithm based on hormone modulation mechanism for job-shop scheduling problem , 2011, Expert Syst. Appl..

[13]  Bin Li,et al.  Variance priority based cooperative co-evolution differential evolution for large scale global optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[14]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[15]  Malabika Basu,et al.  Improved differential evolution for short-term hydrothermal scheduling , 2014 .

[16]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[17]  Yuri N. Sotskov,et al.  Solving parallel machines job-shop scheduling problems by an adaptive algorithm , 2014 .

[18]  De Leone,et al.  Computational Optimization and Applications Volume 34, Number 2, June 2006 , 2006 .

[19]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[20]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[21]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[22]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[23]  S. Meeran,et al.  A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study , 2011, Journal of Intelligent Manufacturing.

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

[25]  Cai Liang-wei.  Optimization of job shop scheduling based on shuffled frog leaping algorithm , 2010 .

[26]  Li-Pei Wong,et al.  Bee colony optimisation algorithm with big valley landscape exploitation for job shop scheduling problems , 2010, Int. J. Bio Inspired Comput..

[27]  Bostjan Murovec.  Job-shop local-search move evaluation without direct consideration of the criterion's value , 2015, Eur. J. Oper. Res..

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

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

[30]  Fuqing Zhao,et al.  An improved shuffled complex evolution algorithm with sequence mapping mechanism for job shop scheduling problems , 2015, Expert Syst. Appl..

[32]  Shi-Jinn Horng,et al.  An efficient job-shop scheduling algorithm based on particle swarm optimization , 2010, Expert Syst. Appl..

[33]  黄德先,et al.  Improved Hybrid Differential Evolution-Estimation of Distribution Algorithm with Feasibility Rules for NLP/MINLP Engineering Optimization Problems , 2012 .

[34]  Quanke Pan,et al.  Differential Evolution Algorithm Based on Blocks on Critical Path for Job Shop Scheduling Problems , 2010 .

[35]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[36]  Xiaohua Wang,et al.  A hybrid biogeography-based optimization algorithm for job shop scheduling problem , 2014, Comput. Ind. Eng..

[37]  Chao Ou-Yang,et al.  Hybrid Estimation of Distribution Algorithm for solving Single Row Facility Layout Problem , 2013, Comput. Ind. Eng..

[38]  Philippe Lacomme,et al.  A GRASP × ELS approach for the job-shop with a web service paradigm packaging , 2014, Expert Syst. Appl..

[39]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[40]  Mario Vanhoucke,et al.  A hybrid single and dual population search procedure for the job shop scheduling problem , 2011, Eur. J. Oper. Res..

[41]  Tiranee Achalakul,et al.  Job Shop Scheduling with the Best-so-far ABC , 2012, Eng. Appl. Artif. Intell..

[42]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[43]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

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

[45]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[46]  Liang Gao,et al.  An efficient memetic algorithm for solving the job shop scheduling problem , 2011, Comput. Ind. Eng..

[47]  T. C. Edwin Cheng,et al.  A tabu search/path relinking algorithm to solve the job shop scheduling problem , 2014, Comput. Oper. Res..

[48]  Antonin Ponsich,et al.  A hybrid Differential Evolution - Tabu Search algorithm for the solution of Job-Shop Scheduling Problems , 2013, Appl. Soft Comput..

[49]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..