• English 
    • español
    • English
    • français
  • FacebookPinterestTwitter
  • español
  • English
  • français
View Item 
  •   DIGIBUG Home
  • 1.-Investigación
  • Departamentos, Grupos de Investigación e Institutos
  • Departamento de Ciencias de la Computación e Inteligencia Artificial
  • DCCIA - Artículos
  • View Item
  •   DIGIBUG Home
  • 1.-Investigación
  • Departamentos, Grupos de Investigación e Institutos
  • Departamento de Ciencias de la Computación e Inteligencia Artificial
  • DCCIA - Artículos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

[PDF] 1272_chica-et-al-is10-180-3465-3487-web.pdf (1.330Mb)
Identificadores
URI: https://hdl.handle.net/10481/97190
DOI: 10.1016/j.ins.2010.05.033
Exportar
RISRefworksMendeleyBibtex
Estadísticas
View Usage Statistics
Metadata
Show full item record
Author
Chica Serrano, Manuel; Cordón García, Óscar; Damas Arroyo, Sergio; Bautista, Joaquín
Editorial
Elsevier
Date
2010-09
Referencia 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
Sponsorship
UPC Nissan Chair; Spanish Ministerio de Educacin y Ciencia (DPI2007-63026); Spanish Ministerio de Ciencia e Innovacin TIN2009-07727; EDRF
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.
Collections
  • DCCIA - Artículos

My Account

LoginRegister

Browse

All of DIGIBUGCommunities and CollectionsBy Issue DateAuthorsTitlesSubjectFinanciaciónAuthor profilesThis CollectionBy Issue DateAuthorsTitlesSubjectFinanciación

Statistics

View Usage Statistics

Servicios

Pasos para autoarchivoAyudaLicencias Creative CommonsSHERPA/RoMEODulcinea Biblioteca UniversitariaNos puedes encontrar a través deCondiciones legales

Contact Us | Send Feedback