Multi-objective constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and random greedy search
Metadatos
Mostrar el registro completo del ítemEditorial
Elsevier
Fecha
2010-09Referencia bibliográfica
Chica Serrano, Manuel et al. Multi-objective constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and random greedy search. Information Sciences Volume 180, Issue 18, 15 September 2010, Pages 3465-3487. https://doi.org/10.1016/j.ins.2010.05.033
Patrocinador
UPC Nissan Chair; Spanish Ministerio de Educacin y Ciencia (DPI2007-63026); Spanish Ministerio de Ciencia e Innovacin TIN2009-07727; EDRFResumen
In this work we present two new multiobjective proposals based on ant colony optimisation and random greedy search algorithms to solve a more realistic extension of a classical industrial problem: time and space assembly line balancing. Some variants of these algorithms have been compared in order to find out the impact of different design configurations and the use of heuristic information. Good performance is shown after applying every algorithm to 10 well-known problem instances in comparison to NSGA-II. In addition, those algorithms which have provided the best results have been employed to tackle a real-world problem at the Nissan plant, located in Spain.