An algorithm to enumerate the set of Pareto optimal spanning trees on some mc-MST instances was put forward by Zhou and Gen, but it does not guarantee returning all the Pareto optimal solutions.

Through the improvement of the option modes of gBest and pBest of PSO algorithm,an optimization algorithm applied to solving multi-objective optimization problems is presented,and the search for Pareto optimal set of multi-objective optimization problems is implemented.

The operation not only helps to maintain uniformity of the Pareto optimal solution set,but enhances the algorithm\'s searching ability.

In multi objective-decision making problems,satisfactory solution often need to be searched in non-inferior solution set.

For example, the well-known weighting method is time-consuming and also easy to leave out some part of total non-inferior solution set.

From the fact that multiobjective programming with indefinite phases has usually only noninferior solutions, the concepts of the noninferior compound matrix of phase return and the recurrence matrix for multiobjective programming with indefinite phases were put forward.

The noninferior solution of mutiobjective decision problem is discussed based on a proposed simple mathematical model of city bus planning.

A genetic algorithm is developed for calculating noninferior solutions of multiobjective optimization in this paper It shows that the method is efficient in a numerical experiment.