Binary integer formulation for mixed-model assembly line balancing problem
Computers and Industrial Engineering
The ant colony optimization meta-heuristic
New ideas in optimization
Learning and optimization using the clonal selection principle
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 12.05 |
Mixed-model assembly lines are production systems at which two or more models are assembled sequentially at the same line. For optimal productivity and efficiency, during the design of these lines, the work to be done at stations must be well balanced satisfying the constraints such as time, space and location. This paper deals with the mixed-model assembly line balancing problem (MALBP). The most common objective for this problem is to minimize the number of stations for a given cycle time. However, the problem of capacity utilization and the discrepancies among station times due to operation time variations are of design concerns together with the number of stations, the line efficiency and the smooth production. A multi-objective ant colony optimization (MOACO) algorithm is proposed here to solve this problem. To prove the efficiency of the proposed algorithm, a number of test problems are solved. The results show that the MOACO algorithm is an efficient and effective algorithm which gives better results than other methods compared.