Research Article

A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets

Volume: 24 Number: 1 February 27, 2018
TR EN

A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets

Abstract

Two-sided assembly lines are heavily used in automotive industry for producing large-sized products such as buses, trucks and automobiles. Mixed-model lines help manufacturers satisfy customized demands at a reasonable cost with desired quality. This paper addresses to mixed-model two-sided lines incorporating incompatible task groups and proposes a new method for minimizing two conflicting objectives, namely cycle time and the number of workstations, to maximize line efficiency. While such an approach yields to a so-called type-E problem in the line balancing domain, the proposed nondominated sorting ant colony optimization (NSACO) approach provides a set of solutions dominating others in terms of both objectives (pareto front solutions). The solution which has the highest line efficiency among pareto front solutions is then determined as the best solution. An additional performance criterion is also applied when two different solutions have the same values for both objectives. The solution which has the smoother workload distribution is favoured when both criteria are the same. NSACO is described and a numerical example is provided to exhibit its running mechanism. The performance of the algorithm is tested through test problems in two conditions, i.e. incompatible task sets are considered and not considered, and computational results are presented for the first time. The results indicate that NSACO has a promising solution capacity.

Keywords

References

  1. Battaïa O, Dolgui A. "A taxonomy of line balancing problems and their solution approaches". International Journal of Production Economics, 142(2), 259-277, 2013.
  2. Kucukkoc I, Zhang DZ. "Balancing of parallel U-shaped assembly lines". Computers and Operations Research, 64, 233-244, 2015.
  3. Diri Z, Mete S, Çil ZA, Ağpak K. "Assembly Line Balancing Problem with Stochastic Sequence-Dependent Setup Times". Pamukkale University Journal of Engineering Sciences, 21(4), 152-157, 2015.
  4. Kucukkoc I, Zhang DZ. "Type-E parallel two-sided assembly line balancing problem: Mathematical model and ant colony optimisation based approach with optimised parameters". Computers and Industrial Engineering, 84, 56–69, 2015.
  5. Kucukkoc I, Zhang DZ. "Mixed-model parallel two-sided assembly line balancing problem: A flexible agent-based ant colony optimization approach". Computers & Industrial Engineering, 97, 58-72, 2016.
  6. Kucukkoc I, Buyukozkan K, Satoglu SI, Zhang DZ. "A mathematical model and artificial bee colony algorithm for the lexicographic bottleneck mixed-model assembly line balancing problem". Journal of Intelligent Manufacturing, 1-13, 2015.
  7. Kucukkoc I, Zhang DZ. "Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines". International Journal of Production Research, 52(12), 3665-3687, 2014.
  8. Thomopoulos NT. "Line balancing-sequencing for mixed-model assembly". Management Science, 14(2), 59-75, 1967.

Details

Primary Language

English

Subjects

Engineering

Journal Section

Research Article

Publication Date

February 27, 2018

Submission Date

March 21, 2017

Acceptance Date

-

Published in Issue

Year 2018 Volume: 24 Number: 1

APA
Küçükkoç, İ. (2018). A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, 24(1), 141-152. https://izlik.org/JA98CM83FA
AMA
1.Küçükkoç İ. A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi. 2018;24(1):141-152. https://izlik.org/JA98CM83FA
Chicago
Küçükkoç, İbrahim. 2018. “A Nondominated Sorting Ant Colony Optimization Algorithm for Complex Assembly Line Balancing Problem Incorporating Incompatible Task Sets”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi 24 (1): 141-52. https://izlik.org/JA98CM83FA.
EndNote
Küçükkoç İ (February 1, 2018) A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi 24 1 141–152.
IEEE
[1]İ. Küçükkoç, “A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets”, Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, vol. 24, no. 1, pp. 141–152, Feb. 2018, [Online]. Available: https://izlik.org/JA98CM83FA
ISNAD
Küçükkoç, İbrahim. “A Nondominated Sorting Ant Colony Optimization Algorithm for Complex Assembly Line Balancing Problem Incorporating Incompatible Task Sets”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi 24/1 (February 1, 2018): 141-152. https://izlik.org/JA98CM83FA.
JAMA
1.Küçükkoç İ. A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi. 2018;24:141–152.
MLA
Küçükkoç, İbrahim. “A Nondominated Sorting Ant Colony Optimization Algorithm for Complex Assembly Line Balancing Problem Incorporating Incompatible Task Sets”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, vol. 24, no. 1, Feb. 2018, pp. 141-52, https://izlik.org/JA98CM83FA.
Vancouver
1.İbrahim Küçükkoç. A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi [Internet]. 2018 Feb. 1;24(1):141-52. Available from: https://izlik.org/JA98CM83FA