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