华南理工大学学报(自然科学版) ›› 2006, Vol. 34 ›› Issue (9): 31-34,39.
• 电子、通信与自动控制 • 上一篇 下一篇
叶明 王宁生
收稿日期:
出版日期:
发布日期:
通信作者:
作者简介:
基金资助:
国家863高技术研究发展计划资助项目(863-511-910-403)
Ye Ming Wang Ning-sheng
Received:
Online:
Published:
Contact:
About author:
Supported by:
摘要: 将可扩展X-.作域概念引入混流装配线中的传送带中断问题,研究了该问题的相关性质:装配线中断发生的充分必要条件,目标函数的边界等.在此基础上,设计了约束集一蚁群算法求解环型油漆车身缓冲区约束下,以传送带中断时间最短为目标的汽车制造排程问题 算例验证了文中解决策略的优越性,同时显示了物料流平准化对传送带中断的影响.
关键词: 汽车排程问题, 蚁群算法, 混流装配线, 传送带中断
Abstract:
The concept of extendable region is introduced to solve the conveyor stoppage problem on a mixed-model assembly line,and some problems,such as the necessary and suficient conditions due to which the conveyor stoppage may occur,and the bounds of the objective function are studied.Then,a restricted-ACO (Ant Colony Optimization)algorithm is proposed to solve the car-sequencing problem with buffer restriction under a round painted body storage,which reaches the objective to minimize the total conveyor stoppage time.Illustrations are finally presented to reveal the advantages of the proposed strategy and the effect of the leveling of material flow on the conveyor stoppage.
Key words: car-sequencing problem, ant colony algorithm, mixed-model assembly line, conveyor stoppage
叶明 王宁生. 基于蚁群算法求解混流装配线传送带中断问题[J]. 华南理工大学学报(自然科学版), 2006, 34(9): 31-34,39.
Ye Ming Wang Ning-sheng. Solving of Conveyor Stoppage of Mixed-Model Assembly Line Based on Ant Colony Algorithm[J]. Journal of South China University of Technology (Natural Science Edition), 2006, 34(9): 31-34,39.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://zrb.bjb.scut.edu.cn/CN/
https://zrb.bjb.scut.edu.cn/CN/Y2006/V34/I9/31