Simple and U-type Assembly Line Balancing by Using an Ant Colony Based Algorithm
AbstractIn 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.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
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.
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.Chicago/Turabian Style
Baykasoğlu, Adil; Dereli, Türkay. 2009. "Simple and U-type Assembly Line Balancing by Using an Ant Colony Based Algorithm." Math. Comput. Appl. 14, no. 1: 1-12.