Buffers sizing in assembly lines using a Lorenz multiobjective ant colony optimization algorithm

Abstract

In this paper, a new multiobjective resolution approach is proposed for solving buffers sizing problems in assembly lines. The considered problem consists of sizing the buffers between the different stations in a line taking in consideration that the size of each buffer is bounded by a lower and an upper value. Two objectives are taken in consideration: the maximization of the throughput rate and the minimization of the total size of the buffers. The resolution method is based on a multiobjective ant colony algorithm but using the Lorenz dominance instead of the well-known Pareto dominance relationship. The Lorenz dominance relationship provides a better domination area by rejecting the solutions founded on the extreme sides of the Pareto front. The obtained results are compared with those of a classical Multiobjective Ant Colony Optimization Algorithm. For that purpose, three different measuring criteria are applied. The numerical results show the advantages and the efficiency of the Lorenz dominance.