An Improved TLBO Algorithm for Balancing Stochastic Two-Sided Assembly Line

Article Preview

Abstract:

The stochastic two-sided assembly line is a special line in which workers perform assembly tasks in both sides of the line and the task time is not deterministic. In the improved teaching-learning-based optimization (ITLBO) algorithm, teacher and learner phases are modified for the discrete problem, a novel merging method is proposed to construct the new evolutionary population and Late Acceptance Hill-Climbing (LAHC) is integrated into the self-learning phase to obtain high quality solutions. The experimental results validate the effectiveness of the proposed algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

345-349

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Bartholdi, J. 1993. Balancing two-sided assembly lines: a case study, International Journal of Production Research, 31(10): 2447-2461.

DOI: 10.1080/00207549308956868

Google Scholar

[2] Kim, Y. K., Kim, Y., Kim, Y. J. 2000. Two-sided assembly line balancing: a genetic algorithm approach, Production Planning & Control, 11(1): 44-53.

DOI: 10.1080/095372800232478

Google Scholar

[3] Özcan, U. 2010. Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm, European Journal of Operational Research, 205(1): 81-97.

DOI: 10.1016/j.ejor.2009.11.033

Google Scholar

[4] Tseng, H. E. 2006. Guided genetic algorithms for solving a larger constraint assembly problem, International Journal of Production Research, 44(3): 601-625.

DOI: 10.1080/00207540500270513

Google Scholar