|
|||||
|
|
Station ant colony optimization for the type 2 assembly line balancing problem |
|
| Authors: | Qiaoxian Zheng Ming Li Yuanxiang Li Qiuhua Tang |
| Affiliation: | 1. Computer College, Wuhan University, Wuhan, 430072, China 2. Faculty of Mathematic & Computer Science, Hubei University, Wuhan, 430062, China 3. Science College, Wuhan University of Science and Technology, Wuhan, 430065, China 4. College of Mechanics and Automation, Wuhan University of Science and Technology, Wuhan, 430065, China |
| Abstract: | An improved ant colony optimization (ACO), namely, station ant colony optimization (SACO), is proposed to solve the type 2 assembly line balancing problem (ALBP-2). In the algorithm, ACO is employed to search different better combinations of tasks (component solutions) for each station; an iteration compress mechanism is proposed to reduce the searching space of feasible solutions of ALBP-2. Three heuristic factors [i.e., (1) task time, (2) number of successors, and (3) number of releasable successors], two pheromones, and a task assignment mechanism are proposed to search better component solutions for every station. Finally, the effectiveness and stability of SACO are confirmed through comparison with literatures in 23 instances included in nine examples. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |