International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 107 - Number 4 |
Year of Publication: 2014 |
Authors: Dipti D. Patil, Bhagyashri D. Dangewar |
10.5120/18738-9983 |
Dipti D. Patil, Bhagyashri D. Dangewar . Multi-Objective Particle Swarm Optimization (MOPSO) based on Pareto Dominance Approach. International Journal of Computer Applications. 107, 4 ( December 2014), 13-15. DOI=10.5120/18738-9983
This paper presents a comprehensive review of a multi-objective particle swarm optimization (MOPSO) reported in the specialized literature. The success of the Particle Swarm Optimization (PSO) algorithm as a single-objective optimizer has motivated researchers to extend the use of bio-inspired technique to other areas. One of them is multi-objective optimization. Multi-objective optimization is a class of problems with solutions that can be evaluated along two or more incomparable or conflicting objectives. These types of problems differ from standard optimization problems in that the end result is not a single est solution" but rather a set of alternatives, where for each member of the set, no other solution is completely better (the Pareto set). Multi-objective optimization problems occur in many different real-world domains such as automobile design and architecture. A multi-objective particle swarm optimization (MOPSO) method can be used to solve the problem of effective channel selection.