Application of Multi-objective Charged System Search Algorithm for Optimization Problems

Abstract

The charged system search algorithm is a relatively new optimization algorithm developed based on some principles from physics and mechanics. This paper presents an approach in which Pareto dominance is incorporated into the charged system search in order to allow this algorithm to handle problems with some multi-objective functions; the proposed algorithm will be called Multi-Objective Charged System Search (MOCSS). Well-known mathematical and engineering benchmarks are used to evaluate the proposed algorithm and the results have been compared with other new approaches. The results of implementing the new algorithm on some test problems show that the proposed algorithm outperforms the other algorithms in terms of Generational Distance, Maximum Spread, Spacing, Coverage of two Set and Hypervolume Indicator. Results of well-known mathematical examples indicate that the new approach is highly competitive and can be considered as a viable alternative to solve multi-objective optimization problems. These results encourage the application of the proposed method to more complex and real-world multi-objective optimization problems. The proposed method can deal with highly nonlinear problems with complex constraints and diverse Pareto optimal sets.