A Multi Ant Colony Optimization algorithm for a Mixed Car Assembly Line
This paper presents an ant colony optimization algorithm to sequence the mixed assembly lines considering the inventory and the replenishment of components. This is a NP-problem that cannot be solved to optimality by exact methods when the size of the problem growth. Groups of specialized ants are implemented to solve the different parts of the problem. This is intended to differentiate each part of the problem. Different types of pheromone structures are created to identify good car sequences, and good routes for the replenishment of components vehicle. The contribution of this paper is the collaborative approach of the ACO for the mixed assembly line and the replenishment of components and the jointly solution of the problem.
E.T.S.I. Industriales (UPM)
XV Multiconferencia CAEPIA | IX Congreso Español de Metaheurísticas, Algoritmos Evolutivos y Bioinspirados - MAEB 2013 | 17/09/2013 - 20/09/2013 | Madrid
Ponencia en Congreso o Jornada