Testing the Permutation Space Based Geometric Differential Evolution on the Job-Shop Scheduling Problem

From within the variety of research that has been devoted to the adaptation of Differential Evolution to the solution of problems dealing with permutation variables, the Geometric Differential Evolution algorithm appears to be a very promising strategy. This approach is based on a geometric interpretation of the evolutionary operators and has been specifically proposed for combinatorial optimization. Such an approach is adopted in this paper, in order to evaluate its efficiency on a challenging class of combinatorial optimization problems: the Job-Shop Scheduling Problem. This algorithm is implemented and tested on a selection of instances normally adopted in the specialized literature. The results obtained by this approach are compared with respect to those generated by a classical DE implementation (using Random Keys encoding for the decision variables). Our computational experiments reveal that, although Geometric Differential Evolution performs (globally) as well as classical DE, it is not really able to significantly improve its performance.

[1]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[2]  B. Roy,et al.  Les Problemes d'Ordonnancement , 1967 .

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

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

[5]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[6]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[7]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[8]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[9]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

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

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

[12]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

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

[14]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[15]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

[16]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[17]  Carlos A. Coello Coello,et al.  Modified Differential Evolution for Constrained Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[18]  C. Coello,et al.  Cultured differential evolution for constrained optimization , 2006 .

[19]  Riccardo Poli,et al.  Geometric Particle Swarm Optimisation , 2007, EuroGP.

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

[21]  Peigen Li,et al.  A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..

[22]  Julian Togelius,et al.  Geometric particle swarm optimization , 2008 .

[23]  Julian Togelius,et al.  Geometric differential evolution , 2009, GECCO '09.

[24]  Antonin Ponsich,et al.  Solving Permutation Problems with Differential Evolution: An Application to the Jobshop Scheduling Problem , 2009, 2009 Ninth International Conference on Intelligent Systems Design and Applications.