Chinese Journal of Mechanical Engineering

, Volume 28, Issue 5, pp 1067–1079 | Cite as

Effective hybrid teaching-learning-based optimization algorithm for balancing two-sided assembly lines with multiple constraints

  • Qiuhua Tang
  • Zixiang Li
  • Liping Zhang
  • C. A. Floudas
  • Xiaojun Cao
Article

Abstract

Due to the NP-hardness of the two-sided assembly line balancing (TALB) problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints (TALB-MC). Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization (TLBO) algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost function. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search (VNS) is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm (LAHC) for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.

Keywords

two-sided assembly line balancing teaching-learning-based optimization algorithm variable neighborhood search positional constraints zoning constraints synchronism constraints 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    BARTHOLDI J J. Balancing two-sided assembly lines: a case study[J]. International Journal of Production Research, 1993, 31: 2447–2461.CrossRefGoogle Scholar
  2. [2]
    LEE T O, KIM Y, KIM Y K. Two-sided assembly line balancing to maximize work relatedness and slackness[J]. Comput. Ind. En., 2001, 40(3): 273–292.CrossRefGoogle Scholar
  3. [3]
    KIM Y K, KIM Y, KIM Y J. Two-sided assembly line balancing: a genetic algorithm approach[J]. Prod Plan Control, 2000, 11(1): 44–53.CrossRefGoogle Scholar
  4. [4]
    BAYKASOGLU A, DERELI T. Two-sided assembly line balancing using an ant-colony-based heuristic[J]. Int. J. Adv. Manuf. Technol., 2008, 36: 582–588.CrossRefGoogle Scholar
  5. [5]
    SIMARIA A S, VILARINHO P M. 2-ANTBAL: An ant colony optimisation algorithm for balancing two-sided assembly lines[J]. Computers & Industrial Engineering, 2009, 56(2): 489–506.CrossRefGoogle Scholar
  6. [6]
    RAO R V, SAVSANI V J, VAKHARIA D P. Teaching-learningbased optimization: a novel method for constrained mechanical design optimization problems[J]. Computer-Aided Design, 2011, 43(3): 303–315.CrossRefGoogle Scholar
  7. [7]
    PAWAR P J, RAO R V. Parameter optimization of machining processes using teaching–learning-based optimization algorithm[J]. Int. J. Adv. Manuf. Technol., 2013, 67: 995–1006.CrossRefGoogle Scholar
  8. [8]
    RAO R V, SAVSANI V J, VAKHARIA D P. Teaching-learningbased optimization: an optimization method for continuous non-linear large scale problems[J]. Information Sciences, 2012, 183(1): 1–15.MathSciNetCrossRefGoogle Scholar
  9. [9]
    MLADENOVIC N, HANSEN P. Variable neighborhood search[J]. Computers & Operations Research, 1997, 24: 1097–1100.MATHMathSciNetCrossRefGoogle Scholar
  10. [10]
    HU X, ERFEI W, YE J. A station-oriented enumerative algorithm for two-sided assembly line balancing[J]. European Journal of Operational Research, 2008, 186: 435–440.MATHCrossRefGoogle Scholar
  11. [11]
    WU E F, JIN Y, BAO J S, HU X F. A branch-and-bound algorithm for two-sided assembly line balancing[J]. International Journal of Advanced Manufacturing Technology, 2008, 39: 1009–1015.CrossRefGoogle Scholar
  12. [12]
    KIM Y K, SONG W S, KIM J H. A mathematical model and a genetic algorithm for two-sided assembly line balancing[J]. Computers & Operations Research, 2009, 36(3): 853–865.MATHCrossRefGoogle Scholar
  13. [13]
    ÖZCAN U, TOKLU B. A tabu search algorithm for two-sided assembly line balancing[J]. International Journal of Advanced Manufacturing Technology, 2009, 43: 822–829.CrossRefGoogle Scholar
  14. [14]
    ÖZCAN U, TOKLU B. Multiple-criteria decision-making in two-sided assembly line balancing: A goal programming and a fuzzy goal programming models[J]. Computers & Operations Research, 2009, 36(6): 1955–1965.MATHCrossRefGoogle Scholar
  15. [15]
    ÖCAN U, TOKLU B. Balancing of mixed-model two-sided assembly lines[J]. Computers & Industrial Engineering, 2009, 57(1): 217–227.CrossRefGoogle Scholar
  16. [16]
    HU X F, WU E F, BAO J S, et al. A branch-and-bound algorithm to minimize the line length of a two-sided assembly line[J]. European Journal of Operational Research, 2010, 206(3): 703–707.MATHCrossRefGoogle Scholar
  17. [17]
    ÖZCAN U. Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm[J]. European Journal of Operational Research, 2010, 205(1): 81–97.MATHCrossRefGoogle Scholar
  18. [18]
    ÖZBAKIR L, TAPKAN P. Balancing fuzzy multi-objective two-sided assembly lines via bees algorithm[J]. Journal of Intelligent & Fuzzy Systems, 2010, 21(5): 317–329.MATHGoogle Scholar
  19. [19]
    ÖZBAKIR L, TAPKAN P. Bee colony intelligence in zone constrained two-sided assembly line balancing problem[J]. Expert Systems with Applications, 2011, 38(9): 11947–11957.CrossRefGoogle Scholar
  20. [20]
    TAPKAN P, OZBAKIR L, BAYKASOGLU A. Bees algorithm for constrained fuzzy multi-objective two-sided assembly line balancing problem[J]. Optimization Letters, 2012, 6(6): 1039–1049.MATHMathSciNetCrossRefGoogle Scholar
  21. [21]
    CHUTIMA P, CHIMKLAI P. Multi-objective two-sided mixed-model assembly line balancing using particle swarm optimisation with negative knowledge[J]. Computers & Industrial Engineering, 2012,62(1): 39–55.CrossRefGoogle Scholar
  22. [22]
    BIAO Y, CHAOYONG Z, XINYU S. A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints[J]. J. Intell. Manuf., 2015, 26(1): 159–168.CrossRefGoogle Scholar
  23. [23]
    BEAN J. Genetics and random keys for sequencing and optimization[J]. ORSA Journal on Computing, 1994, 6(2): 154–160.MATHCrossRefGoogle Scholar
  24. [24]
    HANSEN P, MLADENOVIC N. Variable neighborhood search: Principles and applications[J]. European Journal of Operational Research, 2001, 130: 449–467.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Chinese Mechanical Engineering Society and Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Qiuhua Tang
    • 1
  • Zixiang Li
    • 1
  • Liping Zhang
    • 1
  • C. A. Floudas
    • 2
  • Xiaojun Cao
    • 3
  1. 1.Industrial Engineering DepartmentWuhan University of Science and TechnologyWuhanChina
  2. 2.Texas A&M Energy InstituteTexas A&M UniversityCollege StationUSA
  3. 3.Technique Center of Dongfeng Peugeot Citroen Automobile CompanyWuhanChina

Personalised recommendations