关键词: 人工蜂群算法|混流装配线排序|禁忌搜索算法|闲置&mdash, 超载时间|调整时间

Abstract: To solve the sequencing problem of mixed model automobile assembly line, a hybrid Artificial Bee Colony (ABC) algorithm was proposed with the objectives of minimizing total setup time, utility time and idle time. To overcome the defect that ABC could not solve discrete problem, the Tabu Search (TS) algorithm was introduced to design the neighborhood TS algorithm of bee colony. The dynamic parameter was set for neighborhood searching range. The embedded strategy of TS in ABC was designed. An elitism strategy of follow bees was adopted to ensure the global convergence. The scouts and onlookers updating method were presented. Several different scale examples and algorithm comparison was presented to prove the effectiveness and superiority of proposed algorithm for solving assembly sequencing problem.

Key words: artificial bee colony algorithm|assembly line sequencing problem|tabu search algorithm|idle time-utility time|setup time