{"title":"基于信息素权重的多目标蚁群算法","authors":"Lei Yang, Xiaotian Jia, Ganming Liu","doi":"10.1109/CIS52066.2020.00019","DOIUrl":null,"url":null,"abstract":"This paper proposed multi-objective ant colony algorithm based on pheromone weight, which is used to solve multi-objective optimization problems. The algorithm introduces the weight of distance-related in the initialization of pheromones, which is beneficial to the ant speed up the path selection, improving the efficiency of ant search. At the same time, the adaptive variation operator that dynamically adjusts the number of ant neighbors with the number of iterations and the weight Tchebycheff aggregation method are also introduced, which are beneficial to improve the convergence speed and the quality of the algorithm. The algorithm has been compared with other related algorithms using Hypervolume and other indicators in the standard dual Traveling Salesman Problem (TSP), and has been proven that the improved algorithm has better results.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-objective Ant Colony Algorithm Based on Pheromone Weight\",\"authors\":\"Lei Yang, Xiaotian Jia, Ganming Liu\",\"doi\":\"10.1109/CIS52066.2020.00019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposed multi-objective ant colony algorithm based on pheromone weight, which is used to solve multi-objective optimization problems. The algorithm introduces the weight of distance-related in the initialization of pheromones, which is beneficial to the ant speed up the path selection, improving the efficiency of ant search. At the same time, the adaptive variation operator that dynamically adjusts the number of ant neighbors with the number of iterations and the weight Tchebycheff aggregation method are also introduced, which are beneficial to improve the convergence speed and the quality of the algorithm. The algorithm has been compared with other related algorithms using Hypervolume and other indicators in the standard dual Traveling Salesman Problem (TSP), and has been proven that the improved algorithm has better results.\",\"PeriodicalId\":106959,\"journal\":{\"name\":\"2020 16th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 16th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS52066.2020.00019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 16th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS52066.2020.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-objective Ant Colony Algorithm Based on Pheromone Weight
This paper proposed multi-objective ant colony algorithm based on pheromone weight, which is used to solve multi-objective optimization problems. The algorithm introduces the weight of distance-related in the initialization of pheromones, which is beneficial to the ant speed up the path selection, improving the efficiency of ant search. At the same time, the adaptive variation operator that dynamically adjusts the number of ant neighbors with the number of iterations and the weight Tchebycheff aggregation method are also introduced, which are beneficial to improve the convergence speed and the quality of the algorithm. The algorithm has been compared with other related algorithms using Hypervolume and other indicators in the standard dual Traveling Salesman Problem (TSP), and has been proven that the improved algorithm has better results.