An Evolutionary Approach to Practical Constraints in Scheduling: A Case-Study of the Wine Bottling Problem

Practical constraints associated with real-world problems are a key differentiator with respect to more artificially formulated problems. They create challenging variations on what might otherwise be considered as straightforward optimization problems from an evolutionary computation perspective. Through solving various commercial and industrial problems using evolutionary algorithms, we have gathered experience in dealing with practical dynamic constraints. Here, we present proven methods for dealing with these issues for scheduling problems. For use in real-world situations, an evolutionary algorithm must be designed to drive a software application that needs to be robust enough to deal with practical constraints in order to meet the demands and expectations of everyday use by domain specialists who are not necessarily optimization experts. In such situations, addressing these issues becomes critical to success. We show how these challenges can be dealt with by making adjustments to genotypic representation, phenotypic decoding, or the evaluation function itself. The ideas presented in this chapter are exemplified by the means of a case study of a real-world commercial problem, namely that of bottling wine in a mass-production environment. The methods described have the benefit of having been proven by a full-fledged implementation into a software application that undergoes continual and vigorous use in a live environment in which time-varying constraints, arising in multiple different combinations, are a routine occurrence.

[1]  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).

[2]  Gerry Dozier,et al.  Adapting Particle Swarm Optimizationto Dynamic Environments , 2001 .

[3]  Edmund K. Burke,et al.  A memetic algorithm to schedule planned maintenance for the national grid , 1999, JEAL.

[4]  George Chryssolouris,et al.  Dynamic scheduling of manufacturing job shops using genetic algorithms , 2001, J. Intell. Manuf..

[5]  Kalmanje Krishnakumar,et al.  Micro-Genetic Algorithms For Stationary And Non-Stationary Function Optimization , 1990, Other Conferences.

[6]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[7]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[8]  Shengxiang Yang,et al.  Genetic Algorithms with Self-Organizing Behaviour in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[9]  T. Yamada,et al.  Solving the C/sub sum/ permutation flowshop scheduling problem by genetic local search , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[10]  Ling Wang,et al.  A Modified Genetic Algorithm for Job Shop Scheduling , 2002 .

[11]  S. G. Ponnambalam,et al.  A GA-SA Multiobjective Hybrid Search Algorithm for Integrating Lot Sizing and Sequencing in Flow-Line Scheduling , 2003 .

[12]  Lutz Schönemann,et al.  Evolution Strategies in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

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

[14]  D. Petrovic,et al.  A fuzzy logic based production scheduling/rescheduling in the presence of uncertain disruptions , 2006, Fuzzy Sets Syst..

[15]  Oliver Holthaus,et al.  Scheduling in job shops with machine breakdowns: an experimental study , 1999 .

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

[17]  Jürgen Branke,et al.  Proceedings of the Workshop on Evolutionary Algorithms for Dynamic Optimization Problems (EvoDOP-2003) held in conjunction with the Genetic and Evolutionary Computation Conference (GECCO-2003), 12 July 2003, Chicago, USA [online] , 2003 .

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

[19]  Xin Yao,et al.  An immigrants scheme based on environmental information for genetic algorithms in changing environments , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[20]  Shengxiang Yang,et al.  Evolutionary Computation in Dynamic and Uncertain Environments , 2007, Studies in Computational Intelligence.

[21]  John J. Grefenstette,et al.  Proceedings of the 1st International Conference on Genetic Algorithms , 1985 .

[22]  R.W. Morrison,et al.  A test problem generator for non-stationary environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[23]  Gabriel Winter,et al.  Minimum-cost planning of the multimodal transport of pipes with evolutionary computation , 2009 .

[24]  Tapabrata Ray,et al.  Optimum Oil Production Planning using an Evolutionary Approach , 2007, Evolutionary Scheduling.

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

[26]  Ihsan Sabuncuoglu,et al.  Routing-based reactive scheduling policies for machine failures in dynamic job shops , 2001 .

[27]  Kathleen M. Swigger,et al.  An Analysis of Genetic-Based Pattern Tracking and Cognitive-Based Component Tracking Models of Adaptation , 1983, AAAI.

[28]  Ben Paechter,et al.  Real-World Applications of Evolutionary Computing , 2003, Lecture Notes in Computer Science.

[29]  Anil K. Jain,et al.  PRODUCTION SCHEDULING/RESCHEDULING IN FLEXIBLE MANUFACTURING , 1997 .

[30]  Elena Marchiori,et al.  An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling , 2000, EvoWorkshops.

[31]  John J. Grefenstette,et al.  Genetic Algorithms for Changing Environments , 1992, PPSN.

[32]  Mark D. Johnston,et al.  Scheduling with neural networks - the case of the hubble space telescope , 1992, Comput. Oper. Res..

[33]  F. Martinelli.  Stochastic Comparison Algorithm for Discrete Optimization with Estimation of Time-Varying Objective Functions , 1999 .