{"title":"直线和u型装配线平衡问题的多规则多目标蚁群优化","authors":"Christopher L. E. Khaw, S. Ponnambalam","doi":"10.1109/COASE.2009.5234122","DOIUrl":null,"url":null,"abstract":"In this paper, a hybrid algorithm by combining 15 task assignment rules and Ant Colony Optimization (ACO) algorithm to solve straight and U-type assembly line balancing problem to optimize line efficiency and smoothness index is proposed. The algorithm is designed to solve assembly line balancing problems of all sizes. The proposed multi-rule multiobjective ant colony optimization algorithm for straight and Utype assembly line balancing problems is evaluated with various set of benchmark problems and compared with a multi-objective simulated annealing algorithm reported in the literature. The results indicate the better performance of the proposed hybrid algorithm.","PeriodicalId":386046,"journal":{"name":"2009 IEEE International Conference on Automation Science and Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Multi-rule multi-objective Ant Colony Optimization for straight and U-type assembly line balancing problem\",\"authors\":\"Christopher L. E. Khaw, S. Ponnambalam\",\"doi\":\"10.1109/COASE.2009.5234122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a hybrid algorithm by combining 15 task assignment rules and Ant Colony Optimization (ACO) algorithm to solve straight and U-type assembly line balancing problem to optimize line efficiency and smoothness index is proposed. The algorithm is designed to solve assembly line balancing problems of all sizes. The proposed multi-rule multiobjective ant colony optimization algorithm for straight and Utype assembly line balancing problems is evaluated with various set of benchmark problems and compared with a multi-objective simulated annealing algorithm reported in the literature. The results indicate the better performance of the proposed hybrid algorithm.\",\"PeriodicalId\":386046,\"journal\":{\"name\":\"2009 IEEE International Conference on Automation Science and Engineering\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Automation Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COASE.2009.5234122\",\"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 Automation Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2009.5234122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-rule multi-objective Ant Colony Optimization for straight and U-type assembly line balancing problem
In this paper, a hybrid algorithm by combining 15 task assignment rules and Ant Colony Optimization (ACO) algorithm to solve straight and U-type assembly line balancing problem to optimize line efficiency and smoothness index is proposed. The algorithm is designed to solve assembly line balancing problems of all sizes. The proposed multi-rule multiobjective ant colony optimization algorithm for straight and Utype assembly line balancing problems is evaluated with various set of benchmark problems and compared with a multi-objective simulated annealing algorithm reported in the literature. The results indicate the better performance of the proposed hybrid algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
