{"title":"装箱问题的改进蚁群算法研究","authors":"Suxin Wang, Leizhen Wang, Ruiping Shi, Meng Ge","doi":"10.1109/ICCDA.2010.5540875","DOIUrl":null,"url":null,"abstract":"Improved ant colony optimization (ACO) was applied to solve bin-packing problem. A tabu matrix bases on goods is established for ant colony optimization (ACO). Tabu matrix's every column corresponds to goods. Matrix has two rows, first row corresponds to goods load visit state, and second row corresponds to vehicle that ferries the goods. Ant state transfer probability is improved to solve bin-packing problem. According to ants tabu table, all the goods are searched by ants and satisfy the vehicle constrain. Illustrated with a practical case, ACO is feasible for bin-packing problem.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Study on improved ant colony optimization for bin-packing problem\",\"authors\":\"Suxin Wang, Leizhen Wang, Ruiping Shi, Meng Ge\",\"doi\":\"10.1109/ICCDA.2010.5540875\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Improved ant colony optimization (ACO) was applied to solve bin-packing problem. A tabu matrix bases on goods is established for ant colony optimization (ACO). Tabu matrix's every column corresponds to goods. Matrix has two rows, first row corresponds to goods load visit state, and second row corresponds to vehicle that ferries the goods. Ant state transfer probability is improved to solve bin-packing problem. According to ants tabu table, all the goods are searched by ants and satisfy the vehicle constrain. Illustrated with a practical case, ACO is feasible for bin-packing problem.\",\"PeriodicalId\":190625,\"journal\":{\"name\":\"2010 International Conference On Computer Design and Applications\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference On Computer Design and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCDA.2010.5540875\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference On Computer Design and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCDA.2010.5540875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Study on improved ant colony optimization for bin-packing problem
Improved ant colony optimization (ACO) was applied to solve bin-packing problem. A tabu matrix bases on goods is established for ant colony optimization (ACO). Tabu matrix's every column corresponds to goods. Matrix has two rows, first row corresponds to goods load visit state, and second row corresponds to vehicle that ferries the goods. Ant state transfer probability is improved to solve bin-packing problem. According to ants tabu table, all the goods are searched by ants and satisfy the vehicle constrain. Illustrated with a practical case, ACO is feasible for bin-packing problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
