摘要

Multi-objective particle swarm optimization algorithm (MOPSOs) has been found to exhibit fast convergence speed but with high probability to fall into local optimum. To overcome this shortcoming, a population recombination strategy is combined with a new mutation strategy to strengthen the ability to jump out of local optimum. From the investigation conducted, it can be found that, when the MOPSO falls into local optimum, the population will stop producing effective particles to update the archive. Population recombination strategy, which utilizes the information of the best variable found so far to construct the new population. This can increase the probability for population to approach the Pareto optimal front, while additional mutation operation can enhance the diversity of population. Experimental study on the bi-objective and three-objective benchmark problems shows that the MOPSO based on proposed strategies is superior to previous multi-objective algorithms in the literature.