{"title":"排序流水车间问题的蚁群算法","authors":"Ke Shang, Zuren Feng, Liangjun Ke","doi":"10.1109/WCICA.2012.6357949","DOIUrl":null,"url":null,"abstract":"In this paper, a new ant colony optimization algorithm, called finite grade ant colony optimization, is proposed to solve permutation flow shop problem, its main characteristic is that the updated quantities of pheromone trails are independent of objective function values, and the heuristic information provide by Moccellin is adopted. The developed algorithm has been applied to the benchmark problems given by Taillard, Comparison results demonstrate that the performance of the proposed algorithm is promising.","PeriodicalId":114901,"journal":{"name":"Proceedings of the 10th World Congress on Intelligent Control and Automation","volume":"1209 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An ant colony algorithm for permutation flow shop problem\",\"authors\":\"Ke Shang, Zuren Feng, Liangjun Ke\",\"doi\":\"10.1109/WCICA.2012.6357949\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new ant colony optimization algorithm, called finite grade ant colony optimization, is proposed to solve permutation flow shop problem, its main characteristic is that the updated quantities of pheromone trails are independent of objective function values, and the heuristic information provide by Moccellin is adopted. The developed algorithm has been applied to the benchmark problems given by Taillard, Comparison results demonstrate that the performance of the proposed algorithm is promising.\",\"PeriodicalId\":114901,\"journal\":{\"name\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"volume\":\"1209 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2012.6357949\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 10th World Congress on Intelligent Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2012.6357949","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An ant colony algorithm for permutation flow shop problem
In this paper, a new ant colony optimization algorithm, called finite grade ant colony optimization, is proposed to solve permutation flow shop problem, its main characteristic is that the updated quantities of pheromone trails are independent of objective function values, and the heuristic information provide by Moccellin is adopted. The developed algorithm has been applied to the benchmark problems given by Taillard, Comparison results demonstrate that the performance of the proposed algorithm is promising.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
