Ant algorithms for assembly line balancing

Joaquín Bautista, Jordi Pereira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

58 Scopus citations


The present work is focused on the assembly line balancing design problems whose objective is to minimize the number of stations needed to manufacture a product in a line given a fixed cycle time, equivalent to a fixed production rate. The problem is solved using an ACO metaheuristic implementation with different features, obtaining good results. Afterwards, an adaptation of the previous implementation is used to solve a real case problem found in a bike assembly line with a hierarchical multi-objective function and additional constraints between tasks.

Original languageEnglish
Title of host publicationAnt Algorithms - 3rd International Workshop, ANTS 2002, Proceedings
EditorsMarco Dorigo , Gianni di Caro, Michael Sampels
PublisherSpringer Verlag
Number of pages11
ISBN (Print)9783540457244
StatePublished - 2002
Externally publishedYes
Event3rd International Workshop on Ant Algorithms, ANTS 2002 - Brussels, Belgium
Duration: 12 Sep 200214 Sep 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Workshop on Ant Algorithms, ANTS 2002


Dive into the research topics of 'Ant algorithms for assembly line balancing'. Together they form a unique fingerprint.

Cite this