2011
DOI: 10.1016/j.engappai.2010.08.006
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid genetic algorithm for mixed model assembly line balancing problem with parallel workstations and zoning constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
54
0
1

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 124 publications
(59 citation statements)
references
References 23 publications
1
54
0
1
Order By: Relevance
“…The GA are highly relevant for industrial applications, because they are capable of handling problems with non-linear constraints, multiple objectives, and dynamic components -properties that frequently appear in the real-world problems (Goldberg, 2006;Kumar et al, 1992). Since their introduction and subsequent popularization (Holland, 1992), the GA have been frequently used as an alternative optimization tool to the conventional methods (Goldberg, 2006;Parker, 1992) and have been successfully applied in a variety of areas, and still find increasing acceptance (Akpinar & Bayhan, 2011;Al-Duwaish, 2000;Benjamin et al, 1999;da Silva et al, 2010;Paplinski, 2010;Roeva & Slavov, 2011;Roeva, 2008a).…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…The GA are highly relevant for industrial applications, because they are capable of handling problems with non-linear constraints, multiple objectives, and dynamic components -properties that frequently appear in the real-world problems (Goldberg, 2006;Kumar et al, 1992). Since their introduction and subsequent popularization (Holland, 1992), the GA have been frequently used as an alternative optimization tool to the conventional methods (Goldberg, 2006;Parker, 1992) and have been successfully applied in a variety of areas, and still find increasing acceptance (Akpinar & Bayhan, 2011;Al-Duwaish, 2000;Benjamin et al, 1999;da Silva et al, 2010;Paplinski, 2010;Roeva & Slavov, 2011;Roeva, 2008a).…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…In the proposed LNS algorithm, we used task based representation [45], [46], which is used for type-I ALBPs in general. The number of tasks defines the length of the representation schema; however, the situation is different for type-II problems.…”
Section: Solution Representationmentioning
confidence: 99%
“…Genetic Algorithms (GAs), which mimic the evolutionary process in nature, have shown many successful applications to many fields, for example, to solve optimization problems (Akpinar and Bayhan, 2010;Xing et al, 2008), control problems (Witkowska et al, 2007;Belter and Skrzypczyński, 2010), operational problems (Aytug et al, 2003;Hart et al, 2005;Kashan et al, 2008;Wang et al, 1999) and transportation problems (Dridi and Kacem, 2004), etc.…”
Section: Proposed Genetic Algorithm and A Dynamic Programming Algorithmmentioning
confidence: 99%