Multirecombined Evolutionary Algorithm Inspired in the Selfish Gene Theory to Face the Weighted Tardiness Scheduling Problem

In a production system it is usual to stress minimum tardiness to achieve higher client satisfaction. According to the client relevance, job processing cost, and many other considerations a weight is assigned to each job. An important and non-trivial objective is to minimize weighted tardiness. Evolutionary Algorithms have been successfully applied to solve scheduling problems. MCMP-SRI (Multiple Crossover Multiple Parents - Stud Random Immigrants) is a MCMP variant which considers the inclusion of a stud- breeding individual in a parent's pool of random immigrants. The Selfish Gene Algorithm proposed by Corno et al. is an interpretation of Darwinian theory given by the biologist Richard Dawkins. In this work we are showing a new algorithm that combines the MCMP-SRI and Selfish Gene approaches. This algorithm is used to face the weighted tardiness problem in a single machine environment. The paper summarizes implementation details and discusses its performance for a set of problem instances taken from the OR-Library.

[1]  Thomas Bäck,et al.  Empirical Investigation of Multiparent Recombination Operators in Evolution Strategies , 1997, Evolutionary Computation.

[2]  C. Ramos,et al.  A coordination mechanism for real world scheduling problems using genetic algorithms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[3]  Giovanni Squillero,et al.  Exploiting the selfish gene algorithm for evolving cellular automata , 2000, Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium.

[4]  S. Esquivel,et al.  Multiple Crossover Per Couple in genetic algorithms , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[5]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[6]  A. E. Eiben,et al.  Orgy in the Computer: Multi-Parent Reproduction in Genetic Algorithms , 1995, ECAL.

[7]  Andrea Villagra,et al.  STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM , 2002, Cybern. Syst..

[8]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[9]  Wolfgang Banzhaf,et al.  Advances in Artificial Life , 2003, Lecture Notes in Computer Science.

[10]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[11]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[12]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[13]  Giovanni Squillero,et al.  Evolving effective CA/CSTP: BIST architectures for sequential circuits , 2001, SAC.

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

[15]  H. P. Nott,et al.  Genetic algorithms for multiobjective scheduling of combined batch/continuous process plants , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[16]  Giovanni Squillero,et al.  The selfish gene algorithm: a new evolutionary optimization strategy , 1998, SAC '98.

[17]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[18]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[19]  Reinhard Männer,et al.  Parallel Problem Solving from Nature — PPSN III , 1994, Lecture Notes in Computer Science.

[20]  El-Ghazali Talbi,et al.  Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[21]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[22]  Giovanni Squillero,et al.  A new evolutionary algorithm inspired by the selfish gene theory , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[23]  E. Wilson,et al.  Sociobiology. The New Synthesis , 1975 .

[24]  A. E. Eiben,et al.  Genetic algorithms with multi-parent recombination , 1994, PPSN.

[25]  Susana Cecilia Esquivel,et al.  Multiple crossovers between multiple parents to improve search in evolutionary algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[26]  Giovanni Squillero,et al.  Exploiting the Selfish Gene algorithm for evolving hardware cellular automata , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[27]  Chris N. Potts,et al.  Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..

[28]  Peter I. Cowling,et al.  Effective heuristic and metaheuristic approaches to optimize component placement in printed circuit board assembly , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).