Multiobjective constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and random greedy search

  • Authors:

  • Manuel Chica;íscar Cordón;Sergio Damas;Joaquín Bautista

  • Affiliations:

  • European Centre for Soft Computing, Mieres, Spain;European Centre for Soft Computing, Mieres, Spain;European Centre for Soft Computing, Mieres, Spain;Universitat Politècnica de Catalunya, Barcelona, Spain and Nissan Chair, Barcelona, Spain

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.07

Visualization

Abstract

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.