A quick search dynamic vector-evaluated particle swarm optimization algorithm based on fitness distance (DVEPSO/FD) is proposed according to the fact that some dynamic multi-objective optimization methods, such as the DVEPSO, cannot achieve a very accurate Pareto optimal front (POF) tracked after each objective changes, although they exhibit advantages in multi-objective optimization. Featuring a repository update mechanism using the fitness distance together with a quick search mechanism, the DVEPSO/FD is capable of obtaining the optimal values that are closer to the real POF. The fitness distance is used to streamline the repository to improve the distribution of nondominant solutions, and the flight parameters of the particles are adjusted dynamically to improve the search speed. Groups of the standard benchmark experiments are conducted and the results show that, compared with the DVEPSO method, from the figures generated by the test functions, DVEPSO/FD achieves a higher accuracy and clearness with the POF dynamically changing; from the values of performance indexes, the DVEPSO/FD effectively improves the accuracy of the tracked POF without destroying the stability. The proposed DVEPSO/FD method shows a good dynamic change adaptability and solving set ability of the dynamic multi-objective optimization problem.
Read full abstract