Problems with multiple objectives can be solved by using Pareto optimization techniques in evolutionary multi-objective optimization algorithms.
Many applications involve multiple objective functions and the Pareto front may contain a very large number of points. Selecting a solution from such a large set is potentially intractable for a decision maker.
you can use the attached code for MOPS, and if need the other source please send me an Email.
If I understand correctly, you are worried that MOPSO won't work because it requires that all objectives have to be minimized. One simple solution is to multiply the result of the maximizing objective function with -1. This will make it a minimization objective function. When the algorithm outputs the Pareto you take the absolute value of that objective to switch it back to its correct value.
All these answers seem to be correct but may i suggest that you:
1) state your problem and the goal(s) in the simplest, clearest vernacular
2) describe why your "problem" is a problem
3) how you think that attaining your goal will solve the problem
... the reason for this "simplistic" approach is that the "optimal" solution is meaningless if it is the solution to the wrong problem - this happens often
...the simplest way to solve a problem is to go around it if its possible
...it can turn out that the "problem" is, after all, not a problem at all or tat it is actually a benefit