{"title":"蚁群算法在检验规划中的应用","authors":"R. Schmitt, Hanqing Zheng, Xiongfei Zhao, Niels Konig, Raphael Rocha Coelho","doi":"10.1109/CIMSA.2009.5069921","DOIUrl":null,"url":null,"abstract":"Within this paper the application of an ant colony optimization (ACO) algorithm to inspection planning is presented. Since inspection planning is a time consuming task, optimizing these activities plays a major role in the quality inspection field. In this paper the extraction procedures of local inspection path planning (LIPP) and measurement device selection (MDS) to travelling salesman problem (TSP) and subset problem are presented respectively. An ACO algorithm based on Max-Min Ant System (MMAS) is presented for solving the problems. Experiment on industrial workpiece shows the applicability of ACO to inspection planning.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Application of ant colony optimization to inspection planning\",\"authors\":\"R. Schmitt, Hanqing Zheng, Xiongfei Zhao, Niels Konig, Raphael Rocha Coelho\",\"doi\":\"10.1109/CIMSA.2009.5069921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Within this paper the application of an ant colony optimization (ACO) algorithm to inspection planning is presented. Since inspection planning is a time consuming task, optimizing these activities plays a major role in the quality inspection field. In this paper the extraction procedures of local inspection path planning (LIPP) and measurement device selection (MDS) to travelling salesman problem (TSP) and subset problem are presented respectively. An ACO algorithm based on Max-Min Ant System (MMAS) is presented for solving the problems. Experiment on industrial workpiece shows the applicability of ACO to inspection planning.\",\"PeriodicalId\":178669,\"journal\":{\"name\":\"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIMSA.2009.5069921\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIMSA.2009.5069921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Application of ant colony optimization to inspection planning
Within this paper the application of an ant colony optimization (ACO) algorithm to inspection planning is presented. Since inspection planning is a time consuming task, optimizing these activities plays a major role in the quality inspection field. In this paper the extraction procedures of local inspection path planning (LIPP) and measurement device selection (MDS) to travelling salesman problem (TSP) and subset problem are presented respectively. An ACO algorithm based on Max-Min Ant System (MMAS) is presented for solving the problems. Experiment on industrial workpiece shows the applicability of ACO to inspection planning.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
