Assessing the performance of multiobjective genetic algorithms for optimization of a batch process scheduling problem

Scheduling optimization problems provide much potential for innovative solutions by genetic algorithms. The complexities, constraints and practicalities of the scheduling process motivate the development of genetic algorithm (GA) techniques to allow innovative and flexible scheduling solutions. Multiobjective genetic algorithms (MOGAs) extend the standard evolutionary-based genetic algorithm optimization technique to allow individual treatment of several objectives simultaneously. This allows the user to attempt to optimize several conflicting objectives, and to explore the trade-offs, conflicts and constraints inherent in this process. The area of MOGA performance assessment and comparison is a relatively new field, as much research concentrates on applications rather than the theory. However, the theoretical exploration of MOGA performance can have tangible effects on the development of highly practical applications, such as the process plant scheduling system under development in this work. By assessing and comparing the strengths, variations and limitations of the developing MOGA using a quantitative method, a highly efficient MOGA can develop to suit the application. The user can also gain insight into behaviour the application itself. In this work, four MOGAs are implemented to solve a process scheduling optimization problem; using two and five objectives, and two schedule building rules.

[1]  Peter J. Fleming,et al.  Exploring use of multiobjective genetic algorithms for constrained process scheduling , 1999 .

[2]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[3]  Patrick D. Surry,et al.  A Multi-objective Approach to Constrained Optimisation of Gas Supply Networks: the COMOGA Method , 1995, Evolutionary Computing, AISB Workshop.

[4]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[5]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[6]  Iftekhar A. Karimi,et al.  Scheduling algorithms for serial multiproduct batch processes with tardiness penalties , 1991 .

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

[8]  J. Love,et al.  Decomposition of Requirements Specifications for Batch Process Control , 1998 .

[9]  Christian Fonteix,et al.  New Multicriteria Optimization Method Based on the Use of a Diploid Genetic Algorithm: Example of an Industrial Problem , 1995, Artificial Evolution.

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

[11]  H. Ku,et al.  Scheduling in serial multiproduct batch processes with due-date penalties , 1990 .

[12]  Hajime Kita,et al.  Multi-objective optimization by genetic algorithms: a review , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[13]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[14]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[15]  Frank Kursawe,et al.  A Variant of Evolution Strategies for Vector Optimization , 1990, PPSN.

[16]  C. A. Coello Coello,et al.  A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques , 1999, Knowledge and Information Systems.

[17]  Sebastian Engell,et al.  Sequencing of batch operations for a highly coupled production process: Genetic algorithms versus mathematical programming , 1998 .

[18]  Yoshikazu Nishikawa,et al.  A Parallel Genetic Algorithm based on a Neighborhood Model and Its Application to Jobshop Scheduling , 1993, PPSN.

[19]  Michael J. Shaw,et al.  Joint Lot Sizing and Sequencing with Genetic Algorithms for Scheduling: Evolving the Chromosome Structure , 1993, ICGA.

[20]  Minseok Kim,et al.  Intelligent scheduling and monitoring for multi-product networked batch processes , 1996 .

[21]  Stephen F. Smith,et al.  Using Genetic Algorithms to Schedule Flow Shop Releases , 1989, ICGA.

[22]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[23]  P. Good,et al.  Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses , 1995 .

[24]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[25]  Peter J. Fleming,et al.  An initial study of practical multiobjective production scheduling using genetic algorithms , 1996 .

[26]  John E. Beasley,et al.  Constraint Handling in Genetic Algorithms: The Set Partitioning Problem , 1998, J. Heuristics.

[27]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[28]  Andrew G. Livingston,et al.  Environmental impact considerations in the optimal design and scheduling of batch processes , 1997 .

[29]  Peter J. Fleming,et al.  Including real-life problem preferences in genetic algorithms to improve optimisation of production schedules , 1997 .

[30]  Luis Puigjaner,et al.  Completion times in multipurpose batch plants with set-up, transfer and clean-up times , 1996 .

[31]  Kazuhiko Kawamura,et al.  Exploring Problem-Specific Recombination Operators for Job Shop Scheduling , 1991, ICGA.