关键词: 人工蜂群算法, 混流装配线排序问题, 最小生产循环, 模拟退火算法

Abstract: To solve the discrete mixed-model sequencing problem, a modified algorithm based on Artificial Bee Colony (ABC) was proposed. NEH method was used to optimize initial population's quality. To improve searching precision and scope, a variable neighborhood region searching mechanism with simulated annealing algorithm was established. An optimal population control strategy was proposed to limit the growth speed of the optimal populations, reduce population similarity and improve global searching performance of the algorithm. In experiment, parameters of modified algorithm were set through simulation comparison of standard instances, and benchmark instances were used to make comparisons among ABC, Genetic Algorithm (GA), Hybrid Genetic Algorithm (HGA) and Modified Particle Swam Optimization (MPSO). Through a mixed sequencing instance simulation, the validity of the algorithm on mixed assembly line sequencing problem was proved.

Key words: artificial bee colony algorithm, mixed assembly line sequencing problem, minimum part set, simulated annealing algorithm