This paper aims a novel and a useful multi-objective optimization approach named Non-Dominated Sorting Ions Motion Algorithm (NSIMO) built on the search procedure of Ions Motion Algorithm (IMO). NSIMO uses selective crowding distance and non-dominated sorting method to obtain various non-domination levels and preserve diversity amongst the best set of solutions. The suggested technique is employed to various multi-objective benchmark functions having different characteristics like convex, concave, multimodal, and discontinuous Pareto fronts. The recommended method is analyzed on different engineering problems having distinct features. The results of the proposed approach are compared with other well-regarded and novel algorithms. Furthermore, we present that the projected method is easy to implement, capable of producing a nearly true Pareto front and algorithmically inexpensive.