A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets
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 in...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Pamukkale University
2018-02-01
|
| Series: | Pamukkale University Journal of Engineering Sciences |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/tr/pub/pajes/issue/35876/400852 |
| _version_ | 1797919415841325056 |
|---|---|
| author | İbrahim Küçükkoç |
| author_facet | İbrahim Küçükkoç |
| author_sort | İbrahim Küçükkoç |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-10T13:46:17Z |
| format | Article |
| id | doaj.art-152ef6a99e2d4664a4afb93fe32da7ee |
| institution | Directory Open Access Journal |
| issn | 1300-7009 2147-5881 |
| language | English |
| last_indexed | 2024-04-10T13:46:17Z |
| publishDate | 2018-02-01 |
| publisher | Pamukkale University |
| record_format | Article |
| series | Pamukkale University Journal of Engineering Sciences |
| spelling | doaj.art-152ef6a99e2d4664a4afb93fe32da7ee2023-02-15T16:10:58ZengPamukkale UniversityPamukkale University Journal of Engineering Sciences1300-70092147-58812018-02-01241141152218A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task setsİbrahim Küçükkoç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.https://dergipark.org.tr/tr/pub/pajes/issue/35876/400852assembly line balancingmixed-modeltwo-sided linesincompatible task set constraintsnondominated sorting ant colony optimizationmontaj hattı dengelemekarışık-modeli̇ki taraflı hatlaruyumsuz iş seti kısıtlarıbastırılmamış sınıflandırmalı karınca koloni optimizasyonu |
| spellingShingle | İbrahim Küçükkoç A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets Pamukkale University Journal of Engineering Sciences assembly line balancing mixed-model two-sided lines incompatible task set constraints nondominated sorting ant colony optimization montaj hattı dengeleme karışık-model i̇ki taraflı hatlar uyumsuz iş seti kısıtları bastırılmamış sınıflandırmalı karınca koloni optimizasyonu |
| title | A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets |
| title_full | A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets |
| title_fullStr | A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets |
| title_full_unstemmed | A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets |
| title_short | A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets |
| title_sort | nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets |
| topic | assembly line balancing mixed-model two-sided lines incompatible task set constraints nondominated sorting ant colony optimization montaj hattı dengeleme karışık-model i̇ki taraflı hatlar uyumsuz iş seti kısıtları bastırılmamış sınıflandırmalı karınca koloni optimizasyonu |
| url | https://dergipark.org.tr/tr/pub/pajes/issue/35876/400852 |
| work_keys_str_mv | AT ibrahimkucukkoc anondominatedsortingantcolonyoptimizationalgorithmforcomplexassemblylinebalancingproblemincorporatingincompatibletasksets AT ibrahimkucukkoc nondominatedsortingantcolonyoptimizationalgorithmforcomplexassemblylinebalancingproblemincorporatingincompatibletasksets |