{"title":"一种新的基于学习的动态多目标优化进化算法","authors":"Xiaogang Fu, Jianyong Sun","doi":"10.1109/CEC.2017.7969332","DOIUrl":null,"url":null,"abstract":"Solving dynamic multi-objective optimisation problem means to search adaptively for the Pareto optimal solutions when the environment changes. It is important to find out the changing pattern for the efficiency of the evolutionary search. Learning techniques are thus widely used to explore the dependence structure of the changing for population re-initialisation in the evolutionary search paradigm. The learning techniques are expected to discover some useful knowledge from history information, while the learned knowledge can help improve the search speed through good initialisation when change occurs. In this paper, we propose a new learning strategy based on the incorporation of mutual information, stable matching strategy and Newton's laws of motion. Mutual information is used to identify the relationship between previously found solutions; the stable matching strategy is used to associate previous found solutions bijectively and Newton's Laws of motion is applied to re-initialise the new population. Controlled experiments were carried out systematically on some widely used test problems. Comparison against several state-of-the-art dynamic multi-objective evolutionary algorithms showed comparable performance in favour of the developed algorithm.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new learning based dynamic multi-objective optimisation evolutionary algorithm\",\"authors\":\"Xiaogang Fu, Jianyong Sun\",\"doi\":\"10.1109/CEC.2017.7969332\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Solving dynamic multi-objective optimisation problem means to search adaptively for the Pareto optimal solutions when the environment changes. It is important to find out the changing pattern for the efficiency of the evolutionary search. Learning techniques are thus widely used to explore the dependence structure of the changing for population re-initialisation in the evolutionary search paradigm. The learning techniques are expected to discover some useful knowledge from history information, while the learned knowledge can help improve the search speed through good initialisation when change occurs. In this paper, we propose a new learning strategy based on the incorporation of mutual information, stable matching strategy and Newton's laws of motion. Mutual information is used to identify the relationship between previously found solutions; the stable matching strategy is used to associate previous found solutions bijectively and Newton's Laws of motion is applied to re-initialise the new population. Controlled experiments were carried out systematically on some widely used test problems. Comparison against several state-of-the-art dynamic multi-objective evolutionary algorithms showed comparable performance in favour of the developed algorithm.\",\"PeriodicalId\":335123,\"journal\":{\"name\":\"2017 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"2015 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2017.7969332\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2017.7969332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new learning based dynamic multi-objective optimisation evolutionary algorithm
Solving dynamic multi-objective optimisation problem means to search adaptively for the Pareto optimal solutions when the environment changes. It is important to find out the changing pattern for the efficiency of the evolutionary search. Learning techniques are thus widely used to explore the dependence structure of the changing for population re-initialisation in the evolutionary search paradigm. The learning techniques are expected to discover some useful knowledge from history information, while the learned knowledge can help improve the search speed through good initialisation when change occurs. In this paper, we propose a new learning strategy based on the incorporation of mutual information, stable matching strategy and Newton's laws of motion. Mutual information is used to identify the relationship between previously found solutions; the stable matching strategy is used to associate previous found solutions bijectively and Newton's Laws of motion is applied to re-initialise the new population. Controlled experiments were carried out systematically on some widely used test problems. Comparison against several state-of-the-art dynamic multi-objective evolutionary algorithms showed comparable performance in favour of the developed algorithm.