双目标混合装配线平衡的多智能体系统

L. Liao, Ching-Jen Huang, Cinho Lin
{"title":"双目标混合装配线平衡的多智能体系统","authors":"L. Liao, Ching-Jen Huang, Cinho Lin","doi":"10.1109/ICMA.2010.37","DOIUrl":null,"url":null,"abstract":"Due to increasing competition and differentiated demand, assembly line is no longer sufficient to offer only standardized products. To satisfy the requirement of customers with the advantages of an efficient flow line, some product variants are allowed to produce simultaneously on the same assembly line. This paper proposes a multi-agent based algorithm for a mixed-assembly line balancing problem (MALBP). The model is constructed by two-level agent architecture. In the first level, a planning agent is built to determine line cycle time based on customer demand. According to the cycle time, the ideal number of workstation is determined. In the second level, there are a balancing agent and multiple machine agents collaborating to balance the workloads of all workstations. The balancing agent records the task precedence constraints and the workload of each workstation, and calculates the efficiency of line balancing. Tabu search algorithm is applied as a communication mechanism between machine agents to adjust the workloads of all workstations. The primary objective is to minimize the number of workstation for a given cycle time, and secondary objective is to minimize the variance of the workload of workstations. In this paper, a workstation is viewed as an agent. Adjacent swap and insert mechanism is applied to search the neighborhood, and, furthermore, tabu list is used to avoid the solution trapped into local optimal.","PeriodicalId":233469,"journal":{"name":"2010 International Conference on Manufacturing Automation","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multi-agent System for Balancing Mixed-Model Assembly Lines with Bi-objective\",\"authors\":\"L. Liao, Ching-Jen Huang, Cinho Lin\",\"doi\":\"10.1109/ICMA.2010.37\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to increasing competition and differentiated demand, assembly line is no longer sufficient to offer only standardized products. To satisfy the requirement of customers with the advantages of an efficient flow line, some product variants are allowed to produce simultaneously on the same assembly line. This paper proposes a multi-agent based algorithm for a mixed-assembly line balancing problem (MALBP). The model is constructed by two-level agent architecture. In the first level, a planning agent is built to determine line cycle time based on customer demand. According to the cycle time, the ideal number of workstation is determined. In the second level, there are a balancing agent and multiple machine agents collaborating to balance the workloads of all workstations. The balancing agent records the task precedence constraints and the workload of each workstation, and calculates the efficiency of line balancing. Tabu search algorithm is applied as a communication mechanism between machine agents to adjust the workloads of all workstations. The primary objective is to minimize the number of workstation for a given cycle time, and secondary objective is to minimize the variance of the workload of workstations. In this paper, a workstation is viewed as an agent. Adjacent swap and insert mechanism is applied to search the neighborhood, and, furthermore, tabu list is used to avoid the solution trapped into local optimal.\",\"PeriodicalId\":233469,\"journal\":{\"name\":\"2010 International Conference on Manufacturing Automation\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Manufacturing Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMA.2010.37\",\"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 Manufacturing Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMA.2010.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着竞争的加剧和需求的差异化,装配线已经不足以提供标准化的产品。为了满足客户的需求,利用高效流水线的优势,允许在同一条装配线上同时生产某些产品变体。提出了一种基于多智能体的混合装配线平衡算法。该模型采用两级代理体系结构构建。在第一层,构建规划代理,根据客户需求确定线路周期时间。根据循环时间,确定理想的工位数。在第二层,有一个平衡代理和多个机器代理协作来平衡所有工作站的工作负载。平衡代理记录任务优先约束和各工作站的工作负载,计算线路平衡的效率。采用禁忌搜索算法作为机器代理之间的通信机制,调整各工作站的工作负载。主要目标是在给定的周期时间内最小化工作站的数量,次要目标是最小化工作站工作负载的变化。在本文中,工作站被视为一个代理。采用邻域交换插入机制搜索邻域,利用禁忌列表避免陷入局部最优。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-agent System for Balancing Mixed-Model Assembly Lines with Bi-objective
Due to increasing competition and differentiated demand, assembly line is no longer sufficient to offer only standardized products. To satisfy the requirement of customers with the advantages of an efficient flow line, some product variants are allowed to produce simultaneously on the same assembly line. This paper proposes a multi-agent based algorithm for a mixed-assembly line balancing problem (MALBP). The model is constructed by two-level agent architecture. In the first level, a planning agent is built to determine line cycle time based on customer demand. According to the cycle time, the ideal number of workstation is determined. In the second level, there are a balancing agent and multiple machine agents collaborating to balance the workloads of all workstations. The balancing agent records the task precedence constraints and the workload of each workstation, and calculates the efficiency of line balancing. Tabu search algorithm is applied as a communication mechanism between machine agents to adjust the workloads of all workstations. The primary objective is to minimize the number of workstation for a given cycle time, and secondary objective is to minimize the variance of the workload of workstations. In this paper, a workstation is viewed as an agent. Adjacent swap and insert mechanism is applied to search the neighborhood, and, furthermore, tabu list is used to avoid the solution trapped into local optimal.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信