Ant algorithms for a time and space constrained assembly line balancing problem

The present article focuses on the application of a procedure based on ant colonies to solve an assembly line balancing problem. After an introduction to assembly line problems, the problem under study is presented: the Time and Space constrained Assembly Line Balancing Problem (TSALBP); and a basic...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2007-03, Vol.177 (3), p.2016-2032
Main Authors: Bautista, Joaquín, Pereira, Jordi
Format: Article
Language:English
Subjects:
Algorithms
Artificial intelligence
Assembly lines
Insects
Manufacturing
Metaheuristics
Production
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The present article focuses on the application of a procedure based on ant colonies to solve an assembly line balancing problem. After an introduction to assembly line problems, the problem under study is presented: the Time and Space constrained Assembly Line Balancing Problem (TSALBP); and a basic model of one of its variants is put forward for study. Subsequently, an ant algorithm is presented that incorporates some ideas that have offered good results with simple balancing problems. Finally, the validity of the proposed algorithms is tested by means of a computational experience with reference instances, and the conclusions of the study are presented.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2005.12.017