In this study, two new Multi-Objective Optimization (MOO) techniques are developed. The two new techniques, the Objective-Based Gradient Algorithm (OBGA) and the Principal Component Grid Algorithm (PCGA), were developed with the goals of improving the accuracy and efficiency of the Pareto domain approximation relative to current MOO techniques. Both methods were compared to current MOO techniques using several test problems. It was found that both the OBGA and PCGA systematically produced a more accurate Pareto domain than current MOO techniques used for comparison, for all problems studied. The OBGA requires less computation time than the current MOO methods for relatively simple problems whereas for more complex objective functions, the computation time was larger. On the other hand, the efficiency of the PCGA was higher than the current MOO techniques for all problems tested. The new techniques were also applied to complex chemical engineering problems. The OBGA was applied to an industrial reactor producing ethylene oxide from ethylene. The optimization varied four of the reactor input parameters, and the selectivity, productivity and a safety factor related to the presence of oxygen in the reactor were maximized. From the optimization results, recommendations were made based on the ideal reactor operating conditions, and the control of key reactor parameters. The PCGA was applied to a PI controller model to develop new tuning methods based on the Pareto domain. The developed controller tuning methods were compared to several previously developed controller correlations. It was found that all previously developed controller correlations showed equal or worse performance than that based on the Pareto domain. The tuning methods were applied to a fourth order process and a process with a disturbance, and demonstrated excellent performance.

In this study, two new Multi-Objective Optimization (MOO) techniques are developed. The two new techniques, the Objective-Based Gradient Algorithm (OBGA) and the Principal Component Grid Algorithm (PCGA), were developed with the goals of improving the accuracy and efficiency of the Pareto domain approximation relative to current MOO techniques. Both methods were compared to current MOO techniques using several test problems. It was found that both the OBGA and PCGA systematically produced a more accurate Pareto domain than current MOO techniques used for comparison, for all problems studied. The OBGA requires less computation time than the current MOO methods for relatively simple problems whereas for more complex objective functions, the computation time was larger. On the other hand, the efficiency of the PCGA was higher than the current MOO techniques for all problems tested. The new techniques were also applied to complex chemical engineering problems. The OBGA was applied to an industrial reactor producing ethylene oxide from ethylene. The optimization varied four of the reactor input parameters, and the selectivity, productivity and a safety factor related to the presence of oxygen in the reactor were maximized. From the optimization results, recommendations were made based on the ideal reactor operating conditions, and the control of key reactor parameters. The PCGA was applied to a PI controller model to develop new tuning methods based on the Pareto domain. The developed controller tuning methods were compared to several previously developed controller correlations. It was found that all previously developed controller correlations showed equal or worse performance than that based on the Pareto domain. The tuning methods were applied to a fourth order process and a process with a disturbance, and demonstrated excellent performance.

In this study, two new Multi-Objective Optimization (MOO) techniques are developed. The two new techniques, the Objective-Based Gradient Algorithm (OBGA) and the Principal Component Grid Algorithm (PCGA), were developed with the goals of improving the accuracy and efficiency of the Pareto domain approximation relative to current MOO techniques. Both methods were compared to current MOO techniques using several test problems. It was found that both the OBGA and PCGA systematically produced a more accurate Pareto domain than current MOO techniques used for comparison, for all problems studied. The OBGA requires less computation time than the current MOO methods for relatively simple problems whereas for more complex objective functions, the computation time was larger. On the other hand, the efficiency of the PCGA was higher than the current MOO techniques for all problems tested. The new techniques were also applied to complex chemical engineering problems. The OBGA was applied to an industrial reactor producing ethylene oxide from ethylene. The optimization varied four of the reactor input parameters, and the selectivity, productivity and a safety factor related to the presence of oxygen in the reactor were maximized. From the optimization results, recommendations were made based on the ideal reactor operating conditions, and the control of key reactor parameters. The PCGA was applied to a PI controller model to develop new tuning methods based on the Pareto domain. The developed controller tuning methods were compared to several previously developed controller correlations. It was found that all previously developed controller correlations showed equal or worse performance than that based on the Pareto domain. The tuning methods were applied to a fourth order process and a process with a disturbance, and demonstrated excellent performance.

In this study, two new Multi-Objective Optimization (MOO) techniques are developed. The two new techniques, the Objective-Based Gradient Algorithm (OBGA) and the Principal Component Grid Algorithm (PCGA), were developed with the goals of improving the accuracy and efficiency of the Pareto domain approximation relative to current MOO techniques. Both methods were compared to current MOO techniques using several test problems. It was found that both the OBGA and PCGA systematically produced a more accurate Pareto domain than current MOO techniques used for comparison, for all problems studied. The OBGA requires less computation time than the current MOO methods for relatively simple problems whereas for more complex objective functions, the computation time was larger. On the other hand, the efficiency of the PCGA was higher than the current MOO techniques for all problems tested. The new techniques were also applied to complex chemical engineering problems. The OBGA was applied to an industrial reactor producing ethylene oxide from ethylene. The optimization varied four of the reactor input parameters, and the selectivity, productivity and a safety factor related to the presence of oxygen in the reactor were maximized. From the optimization results, recommendations were made based on the ideal reactor operating conditions, and the control of key reactor parameters. The PCGA was applied to a PI controller model to develop new tuning methods based on the Pareto domain. The developed controller tuning methods were compared to several previously developed controller correlations. It was found that all previously developed controller correlations showed equal or worse performance than that based on the Pareto domain. The tuning methods were applied to a fourth order process and a process with a disturbance, and demonstrated excellent performance.

The purpose of this research project is the design and optimization of complex chemical engineering problems, by employing evolutionary algorithms (EAs). EAs are optimization techniques which mimic the principles of genetics and natural selection. Given their population-based approach, EAs are well suited for solving multiobjective optimization problems (MOOPs) to determine Pareto-optimal solutions. The Pareto front refers to the set of non-dominated solutions which highlight trade-offs among the different objectives. A broad range of applications have been studied, all of which are drawn from the chemical engineering field. The design of an industrial packed bed styrene reactor is initially studied with the goal of maximizing the productivity, yield and selectivity of styrene. The dual population evolutionary algorithm (DPEA) was used to circumscribe the Pareto domain of two and three objective optimization case studies for three different configurations of the reactor: adiabatic, steam-injected and isothermal. The Pareto domains were then ranked using the net flow method (NFM), a ranking algorithm that incorporates the knowledge and preferences of an expert into the optimization routine. Next, a multiobjective optimization of the heat transfer area and pumping power of a shell-and-tube heat exchanger is considered to provide the designer with multiple Pareto-optimal solutions which capture the trade-off between the two objectives. The optimization was performed using the fast and elitist non-dominated sorting genetic algorithm (NSGA-II) on two case studies from the open literature. The algorithm was also used to determine the impact of using discrete standard values of the tube length, diameter and thickness rather than using continuous values to obtain the optimal heat transfer area and pumping power. In addition, a new hybrid algorithm called the FP-NSGA-II, is developed in this thesis by combining a front prediction algorithm with the fast and elitist non-dominated sorting genetic algorithm-II (NSGA-II). Due to the significant computational time of evaluating objective functions in real life engineering problems, the aim of this hybrid approach is to better approximate the Pareto front of difficult constrained and unconstrained problems while keeping the computational cost similar to NSGA-II. The new algorithm is tested on benchmark problems from the literature and on a heat exchanger network problem.

The purpose of this research project is the design and optimization of complex chemical engineering problems, by employing evolutionary algorithms (EAs). EAs are optimization techniques which mimic the principles of genetics and natural selection. Given their population-based approach, EAs are well suited for solving multiobjective optimization problems (MOOPs) to determine Pareto-optimal solutions. The Pareto front refers to the set of non-dominated solutions which highlight trade-offs among the different objectives. A broad range of applications have been studied, all of which are drawn from the chemical engineering field. The design of an industrial packed bed styrene reactor is initially studied with the goal of maximizing the productivity, yield and selectivity of styrene. The dual population evolutionary algorithm (DPEA) was used to circumscribe the Pareto domain of two and three objective optimization case studies for three different configurations of the reactor: adiabatic, steam-injected and isothermal. The Pareto domains were then ranked using the net flow method (NFM), a ranking algorithm that incorporates the knowledge and preferences of an expert into the optimization routine. Next, a multiobjective optimization of the heat transfer area and pumping power of a shell-and-tube heat exchanger is considered to provide the designer with multiple Pareto-optimal solutions which capture the trade-off between the two objectives. The optimization was performed using the fast and elitist non-dominated sorting genetic algorithm (NSGA-II) on two case studies from the open literature. The algorithm was also used to determine the impact of using discrete standard values of the tube length, diameter and thickness rather than using continuous values to obtain the optimal heat transfer area and pumping power. In addition, a new hybrid algorithm called the FP-NSGA-II, is developed in this thesis by combining a front prediction algorithm with the fast and elitist non-dominated sorting genetic algorithm-II (NSGA-II). Due to the significant computational time of evaluating objective functions in real life engineering problems, the aim of this hybrid approach is to better approximate the Pareto front of difficult constrained and unconstrained problems while keeping the computational cost similar to NSGA-II. The new algorithm is tested on benchmark problems from the literature and on a heat exchanger network problem.

The purpose of this research project is the design and optimization of complex chemical engineering problems, by employing evolutionary algorithms (EAs). EAs are optimization techniques which mimic the principles of genetics and natural selection. Given their population-based approach, EAs are well suited for solving multiobjective optimization problems (MOOPs) to determine Pareto-optimal solutions. The Pareto front refers to the set of non-dominated solutions which highlight trade-offs among the different objectives. A broad range of applications have been studied, all of which are drawn from the chemical engineering field. The design of an industrial packed bed styrene reactor is initially studied with the goal of maximizing the productivity, yield and selectivity of styrene. The dual population evolutionary algorithm (DPEA) was used to circumscribe the Pareto domain of two and three objective optimization case studies for three different configurations of the reactor: adiabatic, steam-injected and isothermal. The Pareto domains were then ranked using the net flow method (NFM), a ranking algorithm that incorporates the knowledge and preferences of an expert into the optimization routine. Next, a multiobjective optimization of the heat transfer area and pumping power of a shell-and-tube heat exchanger is considered to provide the designer with multiple Pareto-optimal solutions which capture the trade-off between the two objectives. The optimization was performed using the fast and elitist non-dominated sorting genetic algorithm (NSGA-II) on two case studies from the open literature. The algorithm was also used to determine the impact of using discrete standard values of the tube length, diameter and thickness rather than using continuous values to obtain the optimal heat transfer area and pumping power. In addition, a new hybrid algorithm called the FP-NSGA-II, is developed in this thesis by combining a front prediction algorithm with the fast and elitist non-dominated sorting genetic algorithm-II (NSGA-II). Due to the significant computational time of evaluating objective functions in real life engineering problems, the aim of this hybrid approach is to better approximate the Pareto front of difficult constrained and unconstrained problems while keeping the computational cost similar to NSGA-II. The new algorithm is tested on benchmark problems from the literature and on a heat exchanger network problem.