Simple and U-type Assembly Line Balancing by Using an Ant Colony Based Algorithm
Department of Industrial Engineering, University of Gaziantep, Gaziantep, Turkey
*
Authors to whom correspondence should be addressed.
Math. Comput. Appl. 2009, 14(1), 1-12; https://doi.org/10.3390/mca14010001
Published: 1 April 2009
Abstract
In this paper, an Ant Colony Optimization (ACO) based heuristic algorithm is proposed for solving simple (straight line) and U-shaped assembly line balancing problems (ALBP). The paper makes one of the first attempts to show how ACO heuristic can be used to solve U-shaped ALBP. A new algorithm is proposed in this paper that seamlessly integrates COMSOAL algorithm, Ranked Positional Weight Heuristic (RPWH) and an ACO based heuristic in order to obtain good solutions to simple and U-shaped ALBPs. The result of the computational study has shown that the proposed algorithm is effective in solving simple/U-shaped line balancing problems.
Keywords:
Assembly Line Balancing; Ant Colony Optimization; Heuristics
Share and Cite
MDPI and ACS Style
Baykasoğlu, A.; Dereli, T. Simple and U-type Assembly Line Balancing by Using an Ant Colony Based Algorithm. Math. Comput. Appl. 2009, 14, 1-12. https://doi.org/10.3390/mca14010001
AMA Style
Baykasoğlu A, Dereli T. Simple and U-type Assembly Line Balancing by Using an Ant Colony Based Algorithm. Mathematical and Computational Applications. 2009; 14(1):1-12. https://doi.org/10.3390/mca14010001
Chicago/Turabian StyleBaykasoğlu, Adil, and Türkay Dereli. 2009. "Simple and U-type Assembly Line Balancing by Using an Ant Colony Based Algorithm" Mathematical and Computational Applications 14, no. 1: 1-12. https://doi.org/10.3390/mca14010001
