Ant colony optimization with look forward ant in solving assembly line balancing problem

M.N.I. Sulaiman, Y. Choo, K. Chong
{"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}
引用次数: 11

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用蚁群算法求解装配线平衡问题
本文提出了一种基于蚁群优化技术的装配线平衡问题求解方法。针对一类简单装配线平衡问题(SALBP-1),提出了一种改进的蚁群优化算法。该算法引入了一种在任务选择阶段动态分配优先级规则或启发式信息值的方法,允许蚂蚁在选择任务分配到工作站的考虑过程中期待其直接后继者。本文对算法进行了测试,并与文献数据集进行了比较,结果表明算法具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparison of various Wiener model identification approach in modelling nonlinear process Data mining technique for expertise search in a special interest group knowledge portal A frequent keyword-set based algorithm for topic modeling and clustering of research papers Optimisation model of selective cutting for Timber Harvest Planning in Peninsular Malaysia Reducing network intrusion detection association rules using Chi-Squared pruning technique
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1