UC Merced

Multi-Objective Optimization Problems (MOPs) deal with optimizing several objectives simultaneously and have diverse applications in engineering, economics, logistics, etc. The methods for solving MOPs can generally be classified into stochastic and deterministic approaches. Deterministic approaches are capable of finding the global solution even though they are computationally burdensome. Stochastic methods, on the other hand, can save on computations significantly, although they do not guarantee to find the global solution.

In engineering applications, MOPs can become nonlinear, multi-modal, high dimensional, and have complex structured solutions that makes them more challenging.

This theses follows two major goals. Firstly, it presents new methods and algorithms for solving engineering MOPs by hybridizing the existing methods and comparing their effectiveness by using benchmark problems. The hybrid method combines an evolutionary algorithm with a cell mapping method in order to reduce the computational time while maintaining the quality of the solution. Implementation details on parallel CPU/GPU programming of such methods are discussed as well. The second goal of this thesis is to introduce new applications of MOPs in different areas of engineering such as control design, path planning, fractional systems and airfoil design.