{"title":"用蚁群算法求解装配线平衡问题","authors":"M.N.I. Sulaiman, Y. Choo, K. Chong","doi":"10.1109/DMO.2011.5976514","DOIUrl":null,"url":null,"abstract":"This work presents an approach based on the ant colony optimization technique to address the assembly line balancing problem. An improved ant colony optimization with look forward ant is proposed to solve the simple assembly line balancing problem of type 1 (SALBP-1). The proposed algorithm introduces an approach to dynamically assign the value of priority rule or heuristic information during the task selection phase by allowing the ant to look forward its direct successors during the consideration in selecting a task to be assigned into a workstation. The proposed algorithm is tested and compared with literature data sets and the result from the proposed algorithm shows competitive performance against them.","PeriodicalId":436393,"journal":{"name":"2011 3rd Conference on Data Mining and Optimization (DMO)","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Ant colony optimization with look forward ant in solving assembly line balancing problem\",\"authors\":\"M.N.I. Sulaiman, Y. Choo, K. Chong\",\"doi\":\"10.1109/DMO.2011.5976514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work presents an approach based on the ant colony optimization technique to address the assembly line balancing problem. An improved ant colony optimization with look forward ant is proposed to solve the simple assembly line balancing problem of type 1 (SALBP-1). The proposed algorithm introduces an approach to dynamically assign the value of priority rule or heuristic information during the task selection phase by allowing the ant to look forward its direct successors during the consideration in selecting a task to be assigned into a workstation. The proposed algorithm is tested and compared with literature data sets and the result from the proposed algorithm shows competitive performance against them.\",\"PeriodicalId\":436393,\"journal\":{\"name\":\"2011 3rd Conference on Data Mining and Optimization (DMO)\",\"volume\":\"2007 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 3rd Conference on Data Mining and Optimization (DMO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMO.2011.5976514\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 3rd Conference on Data Mining and Optimization (DMO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMO.2011.5976514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ant colony optimization with look forward ant in solving assembly line balancing problem
This work presents an approach based on the ant colony optimization technique to address the assembly line balancing problem. An improved ant colony optimization with look forward ant is proposed to solve the simple assembly line balancing problem of type 1 (SALBP-1). The proposed algorithm introduces an approach to dynamically assign the value of priority rule or heuristic information during the task selection phase by allowing the ant to look forward its direct successors during the consideration in selecting a task to be assigned into a workstation. The proposed algorithm is tested and compared with literature data sets and the result from the proposed algorithm shows competitive performance against them.