###
DOI:
计算机系统应用英文版:2010,19(1):140-143
本文二维码信息
码上扫一扫!
蚁群算法求解装配线平衡第一类问题
(同济大学 机械工程学院 上海 201804)
Ant Colony Algorithm for Solving the First Category of Assembly Line Balancing Problem
摘要
图/表
参考文献
相似文献
本文已被:浏览 1664次   下载 3205
Received:April 14, 2009    
中文摘要: 装配线平衡问题是生产管理中重要且较难解决的问题,其中第一类问题是装配线平衡问题的关键问题。本文通过对装配线平衡问题的分析与建模,提出了利用蚁群算法这种人工智能优化算法求解一般装配线平衡第一类问题的步骤和算法。采用启发式的方法构造分配方案的生成策略,并对信息素的更新采用局部更新与全局更新相结合的规则,从而使得该算法具有较好的目的性,大大提高了获得最优解的效率。通过该蚁群算法能得到装配线平衡第一类问题质量较优的解,且有速度快、鲁棒性、通用性等优势。
Abstract:Assembly line balancing problem is an important and difficult problem in production management. The first category is the key to the assembly line balancing problem. Based on the assembly line balancing problem analysis and modeling, this paper proposes steps and algorithms of the first category of general assembly line balancing problem using artificial intelligence optimization algorithm of ant colony algorithm, which uses heuristic methods to generate structure program distribution strategy. It introduces pheromone local update policy with a combination of global rules, so that the algorithm has a good purpose, which greatly improved the efficiency of access to the optimal solution. This algorithm can better solve the first type of assembly line balancing problem, and have advantages like high speed, robustness and universal property etc.
文章编号:     中图分类号:    文献标志码:
基金项目:
引用文本:
毛凌翔,郑永前.蚁群算法求解装配线平衡第一类问题.计算机系统应用,2010,19(1):140-143
MAO Ling-Xiang,ZHENG Yong-Qian.Ant Colony Algorithm for Solving the First Category of Assembly Line Balancing Problem.COMPUTER SYSTEMS APPLICATIONS,2010,19(1):140-143