Improving Memory for Solving Dynamic Job Shop Scheduling

When faced with a changing world, humans are apt to look not just to the future, but to the past. Drawing on knowledge from similar situations we have encountered helps us to decide what to do next. The more experience we’ve had with a particular situation, the better we can expect to perform. When solving dynamic problems using search, it may be enough to solve the problem completely from scratch when we encounter it again. An appropriate strategy for store past information is memory. In the researches shown that using standard memory with evolutionary algorithms for solving dynamic optimization problem is capable. Standard memory is containing infirmity point memory determinate capacity. In this paper presented a new memory namely Classifier-based memory, which solves standard memory problems. This memory combined with GA for solving dynamic scheduling. The dynamic job shop scheduling problem is one of the most complex forms of machine scheduling. Classifier-based memory is introduced to extend the use of memory to dynamic problems where solutions may become obsolete as the environment changes. Classifier-based memory creates an abstraction layer between feasible solutions and memory entries so that old solutions stored in memory may be mapped to solutions that are feasible in the current environment. The technique presented in this paper improves the ability of memories to guide search quickly and efficiently to good solutions as the environment changes.

[1]  Tom Lenaerts,et al.  Raising the Dead: Extending Evolutionary Algorithms with a Case-Based Memory , 2001, EuroGP.

[2]  Shengxiang Yang,et al.  Non-stationary problem optimization using the primal-dual genetic algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[3]  Mohammad Reza Meybodi,et al.  CDEPSO: a bi-population hybrid approach for dynamic optimization problems , 2014, Applied Intelligence.

[4]  Ram Rachamadugu,et al.  Real-time scheduling of an automated manufacturing center * , 1989 .

[5]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[6]  Philippe Collard,et al.  An Evolutionary Approach for Time Dependent Optimization , 1997, Int. J. Artif. Intell. Tools.

[7]  Swagatam Das,et al.  Cluster-based differential evolution with Crowding Archive for niching in dynamic environments , 2014, Inf. Sci..

[8]  Emma Hart,et al.  A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems , 1998, PPSN.

[9]  Kok Cheong Wong,et al.  A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization , 1995, ICGA.

[10]  John J. Grefenstette,et al.  Case-Based Initialization of Genetic Algorithms , 1993, ICGA.

[11]  David E. Goldberg,et al.  Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy , 1987, ICGA.

[12]  Parvin Hamid,et al.  GENETIC ALGORITHM BASED ON EXPLICIT MEMORY FOR SOLVING DYNAMIC PROBLEMS , 2016 .

[13]  Philippe Collard,et al.  Time dependent optimization with a folding genetic algorithm , 1997, Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence.

[14]  Shengxiang Yang,et al.  Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems , 2007, EvoWorkshops.

[15]  C. Ryan,et al.  The Degree of Oneness , 2007 .

[16]  Ning Yang,et al.  Memory Based Differential Evolution Algorithms for Dynamic Constrained Optimization Problems , 2015, 2015 11th International Conference on Computational Intelligence and Security (CIS).

[17]  Shengxiang Yang,et al.  Explicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[18]  Shengxiang Yang,et al.  Memory-based immigrants for genetic algorithms in dynamic environments , 2005, GECCO '05.

[19]  Tom Lenaerts,et al.  Dynamic optimization using evolutionary algorithms with a case-based memory , 2002 .

[20]  Jürgen Branke,et al.  Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[21]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[22]  T. Krink,et al.  Dynamic memory model for non-stationary optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).