Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks

AKPINAR Ş., Bayhan G. M., BAYKASOĞLU A.

APPLIED SOFT COMPUTING, vol.13, no.1, pp.574-589, 2013 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 13 Issue: 1
  • Publication Date: 2013
  • Doi Number: 10.1016/j.asoc.2012.07.024
  • Journal Name: APPLIED SOFT COMPUTING
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.574-589
  • Keywords: Any colony optimization, Genetic algorithm, Hybrid meta-heuristics, Mixed-model assembly line balancing, Sequence dependent set-up times, HEURISTIC PROCEDURES, FORMULATION, SOLVE
  • Dokuz Eylül University Affiliated: Yes

Abstract

This paper presents a new hybrid algorithm, which executes ant colony optimization in combination with genetic algorithm (ACO-GA), for type I mixed-model assembly line balancing problem (MMALBP-I) with some particular features of real world problems such as parallel workstations, zoning constraints and sequence dependent setup times between tasks. The proposed ACO-GA algorithm aims at enhancing the performance of ant colony optimization by incorporating genetic algorithm as a local search strategy for MMALBP-I with setups. In the proposed hybrid algorithm ACO is conducted to provide diversification, while GA is conducted to provide intensification. The proposed algorithm is tested on 20 representatives MMALBP-I extended by adding low, medium and high variability of setup times. The results are compared with pure ACO pure GA and hGA in terms of solution quality and computational times. Computational results indicate that the proposed ACO-GA algorithm has superior performance. (C) 2012 Elsevier B. V. All rights reserved.