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...
| Autores: | , , |
|---|---|
| Tipo de documento: | relatório científico |
| Data de publicação: | 2006 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/86033 |
| Acesso em linha: | https://hdl.handle.net/2117/86033 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Assembly line balancing problems Beam search Ant algorithms Metaheuristics Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Resumo: | 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. |
|---|