Beam-ACO applied to assembly line balancing

Assembly line balancing concerns the design of assembly lines for the manufacturing of products. In this paper we consider the time and space constrained simple assembly line balancing problem with the objective of minimizing the number of necessary work stations. This problem is denoted by TSALBP-1...

Descripción completa

Detalles Bibliográficos
Autores: Blum, Christian, Bautista Valhondo, Joaquín|||0000-0002-2214-4991, Pereira Gude, Jordi
Tipo de recurso: informe técnico
Fecha de publicación:2006
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/86033
Acceso en línea:https://hdl.handle.net/2117/86033
Access Level:acceso abierto
Palabra clave:Assembly line balancing problems
Beam search
Ant algorithms
Metaheuristics
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_bcd340f42c60960733ff2e6df326d175
oai_identifier_str oai:upcommons.upc.edu:2117/86033
network_acronym_str ES
network_name_str España
repository_id_str
spelling Beam-ACO applied to assembly line balancingBlum, ChristianBautista Valhondo, Joaquín|||0000-0002-2214-4991Pereira Gude, JordiAssembly line balancing problemsBeam searchAnt algorithmsMetaheuristicsÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaAssembly line balancing concerns the design of assembly lines for the manufacturing of products. In this paper we consider the time and space constrained simple assembly line balancing problem with the objective of minimizing the number of necessary work stations. This problem is denoted by TSALBP-1 in the literature. For tackling this problem we propose a Beam-ACO approach, which is an algorithm that results from hybridizing ant colony optimization with beam search. The experimental results show that our algorithm is a state-of-the-art metaheuristic for this problem.20062006-05-0120162016-04-21reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/86033reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/860332026-05-27T15:37:01Z
dc.title.none.fl_str_mv Beam-ACO applied to assembly line balancing
title Beam-ACO applied to assembly line balancing
spellingShingle Beam-ACO applied to assembly line balancing
Blum, Christian
Assembly line balancing problems
Beam search
Ant algorithms
Metaheuristics
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Beam-ACO applied to assembly line balancing
title_full Beam-ACO applied to assembly line balancing
title_fullStr Beam-ACO applied to assembly line balancing
title_full_unstemmed Beam-ACO applied to assembly line balancing
title_sort Beam-ACO applied to assembly line balancing
dc.creator.none.fl_str_mv Blum, Christian
Bautista Valhondo, Joaquín|||0000-0002-2214-4991
Pereira Gude, Jordi
author Blum, Christian
author_facet Blum, Christian
Bautista Valhondo, Joaquín|||0000-0002-2214-4991
Pereira Gude, Jordi
author_role author
author2 Bautista Valhondo, Joaquín|||0000-0002-2214-4991
Pereira Gude, Jordi
author2_role author
author
dc.subject.none.fl_str_mv Assembly line balancing problems
Beam search
Ant algorithms
Metaheuristics
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Assembly line balancing problems
Beam search
Ant algorithms
Metaheuristics
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description Assembly line balancing concerns the design of assembly lines for the manufacturing of products. In this paper we consider the time and space constrained simple assembly line balancing problem with the objective of minimizing the number of necessary work stations. This problem is denoted by TSALBP-1 in the literature. For tackling this problem we propose a Beam-ACO approach, which is an algorithm that results from hybridizing ant colony optimization with beam search. The experimental results show that our algorithm is a state-of-the-art metaheuristic for this problem.
publishDate 2006
dc.date.none.fl_str_mv 2006
2006-05-01
2016
2016-04-21
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/86033
url https://hdl.handle.net/2117/86033
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869418148519739392
score 15,300719

Similares en LA Referencia