Problems that have more than one objective function are of great importance in engineering sciences and many other disciplines. This class of problems are known as multi-objective optimisation problems (or multicriteria). The difficulty here lies in the conflict between the various objective functions. Due to this conflict, one cannot find a single ideal solution which simultaneously satisfies all the objectives. But instead one can find the set of Pareto-optimal solutions (Pareto-optimal set) and consequently the Pareto-optimal front is established. Finding these solutions plays an important role in multi-objective optimisation problems and mathematically the problem is considered to be solved when the Pareto-optimal set, i.e. the set of all compromise solutions is found. The Pareto-optimal set may contain information that can help the designer make a decision and thus arrive at better trade-off solutions. The aim of this research is to develop new multi-objective optimisation symbolic algorithms capable of detecting relationship(s) among decision variables that can be used for constructing the analytical formula of Pareto-optimal front based on the extension of the current optimality conditions. A literature survey of theoretical and evolutionary computation techniques for handling multiple objectives, constraints and variable interaction highlights a lack of techniques to handle variable interaction. This research, therefore, focuses on the development of techniques for detecting the relationships between the decision variables (variable interaction) in the presence of multiple objectives and constraints. It attempts to fill the gap in this research by formally extending the theoretical results (optimality conditions). The research then proposes first-order multi-objective symbolic algorithm or MOSA-I and second-order multi-objective symbolic algorithm or MOSA-II that are capable of detecting the variable interaction. The performance of these algorithms is analysed and compared to a current state-of-the-art optimisation algorithm using popular test problems. The performance of the MOSA-II algorithm is finally validated using three appropriately chosen problems from literature. In this way, this research proposes a fully tested and validated methodology for dealing with multi-objective optimisation problems. In conclusion, this research proposes two new symbolic algorithms that are used for identifying the variable interaction responsible for constructing Pareto-optimal front among objectives in multi-objective optimisation problems. This is completed based on a development and relaxation of the first and second-order optimality conditions of Karush-Kuhn-Tucker
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.