摘要
针对直线型和U型装配线第一类平衡问题,提出一种基于最优成分信息素更新规则的改进蚁群算法。算法在任务和工作站之间释放信息素,综合利用多种优先权规则作为启发式信息,在解构造中加入下界检查,在全局信息素更新中仅对本次迭代最优解中的最优成分释放信息素,既保留了最优解信息,又增加了探索更优解可能。仿真对比实验表明了该算法的有效性。
Simple（straight line） and U-shaped assembly line balancing problem（ALBP） is discussed.A modified ant colony algorithm is presented for it.By the algorithm,pheromone is defined as the information on the task and assigned workstation to combine task sequencing and task assignment to workstations.Several priority rules are integrated as heuristic information for ant moving.Lower bound calculation is added so as to quickly obtain a good initial solution.During global pheromone updating,pheromone about one task and assigned workstation is allowed to be deposited if the assignment is contained in the optimal solution and the workstation fully operates.In this way,it can search more solutions without losing optimal information.Comparison is made by simulation and it shows that the solution obtained by using the proposed algorithm is better than that obtained by existing algorithms,especially for large-scale ALBPs.
出处
《工业工程》
北大核心
2010年第6期76-81,共6页
Industrial Engineering Journal
基金
国家自然科学基金资助项目(70872031)
教育部"新世纪优秀人才支持计划"资助项目(NCET-08-0212)
教育部人文社科青年基金资助项目(07JC630038)
广州市社会科学规划课题资助项目(08Q04)
关键词
装配线平衡问题
蚁群算法
直线型装配线
U型装配线
assembly line balancing problem（ALBP）
ant colony algorithm
simple assembly line
U-shaped assembly line
