2002
DOI: 10.1016/s0360-8352(02)00018-9
|View full text |Cite
|
Sign up to set email alerts
|

A shape-based block layout approach to facility layout problems using hybrid genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0
7

Year Published

2005
2005
2016
2016

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 85 publications
(34 citation statements)
references
References 8 publications
0
27
0
7
Order By: Relevance
“…For solving the layout problem a combination of GA, SA and Hitchcock's method has been proposed by Mahdi et al in 1998. SA, GA and TS, are combined in a single algorithm for handling fixed shape and unequal sized layout problem by Lee and Lee (2002). A GA-SA-based algorithm for layout design has been presented by Leno et al (2015).…”
Section: Hybrid Algorithmmentioning
confidence: 99%
“…For solving the layout problem a combination of GA, SA and Hitchcock's method has been proposed by Mahdi et al in 1998. SA, GA and TS, are combined in a single algorithm for handling fixed shape and unequal sized layout problem by Lee and Lee (2002). A GA-SA-based algorithm for layout design has been presented by Leno et al (2015).…”
Section: Hybrid Algorithmmentioning
confidence: 99%
“…Chau and Anson (2002) developed a knowledge-based system for construction site level facilities layout. Lee and Lee (2002) presented a shapebased block layout (SBL) approach for solving FLP with unequal-areas and fixed-shapes. The SBL approach employs a hybrid genetic algorithm to find good solution.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Hicks (2004), developed a genetic algorithm for minimizing material movement in a manufacturing cell with application to practical problems related to the capital good industry. Lee et al (2002) proposed a genetic algorithm for solving multi-floor facility layout problems with the facility's inner structure consisting of walls and passages. A study related to the fashion industry was presented by Martens (2004).…”
Section: The Layout Problemmentioning
confidence: 99%
“…Other formulations also exist such as mixed integer programming (Meller et al, 1999) and graph theoretic model (Caccetta & Kusumah, 2001). Many methods are used to solve the layout problem and they are essentially based on metaheuristics such as Genetic Algorithms (GA) (Lee et al, 2002), Tabu Search (Chiang & Chiang, 1998), Simulated Annealing (SA) (Baykasoglu & Gindy, 2001), Ant Colony (Solimanpur et al, 2004). In our study, we consider a layout problem modelled as a QAP.…”
Section: The Layout Problemmentioning
confidence: 99%