Ant Colony Algorithm for Solving the First Category of Assembly Line Balancing Problem
蚁群算法求解装配线平衡第一类问题

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.