- Conference Article
29
- 10.1109/cec.2019.8790005
Solving Dynamic Multi-objective Optimization Problems Using Incremental Support Vector Machine
- Jun 01, 2019
- Weizhen Hu + 4 more +4
The main feature of the Dynamic Multi-objective Optimization Problems (DMOPs)\nis that optimization objective functions will change with times or\nenvironments. One of the promising approaches for solving the DMOPs is reusing\nthe obtained Pareto optimal set (POS) to train prediction models via machine\nlearning approaches. In this paper, we train an Incremental Support Vector\nMachine (ISVM) classifier with the past POS, and then the solutions of the DMOP\nwe want to solve at the next moment are filtered through the trained ISVM\nclassifier. A high-quality initial population will be generated by the ISVM\nclassifier, and a variety of different types of population-based dynamic\nmulti-objective optimization algorithms can benefit from the population. To\nverify this idea, we incorporate the proposed approach into three evolutionary\nalgorithms, the multi-objective particle swarm optimization(MOPSO),\nNondominated Sorting Genetic Algorithm II (NSGA-II), and the Regularity\nModel-based multi-objective estimation of distribution algorithm(RE-MEDA). We\nemploy experiments to test these algorithms, and experimental results show the\neffectiveness.\n
Read more