Real-world problems are often complex and may need to deal with constrained optimization problems (COPs). This has led to a growing interest in optimization techniques that involve more than one objective function to be simultaneously optimized. Accordingly, at the end of the multi-objective optimization process, there will be more than one solution to be considered. This enables a trade-off of high-quality solutions and provides options to the decision-maker to choose a solution based on qualitative preferences. Particle Swarm Optimization (PSO) algorithms are increasingly being used to solve NP-hard and constrained optimization problems that involve multi-objective mathematical representations by finding accurate and robust solutions. PSOs are currently used in many real-world applications, including (but not limited to) medical diagnosis, image processing, speech recognition, chemical reactor, weather forecasting, system identification, reactive power control, stock exchange market, and economic power generation. In this paper, a new version of Multi-objective PSO and Differential Evolution (MOPSO-DE) is proposed to solve constrained optimization problems (COPs). As presented in this paper, the proposed MOPSO-DE scheme incorporates a new leader(s) updating mechanism that is invoked when the system is under the risk of converging to premature solutions, parallel islands mechanism, adaptive mutation, and then integrated to the DE in order to update the particles’ best position in the search-space. A series of experiments are conducted using 12 well-known benchmark test problems collected from the 2006 IEEE Congress on Evolutionary Computation (CEC2006) to verify the feasibility, performance, and effectiveness of the proposed MOPSO-DE algorithm. The simulation results show the proposed MOPSO-DE is highly competitive and is able to obtain the optimal solutions for the all test problems.

This content is only available via PDF.
You do not currently have access to this content.