1998
DOI: 10.1016/s0166-3615(97)00106-1
|View full text |Cite
|
Sign up to set email alerts
|

A solution to the facility layout problem using simulated annealing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0
1

Year Published

2005
2005
2019
2019

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 86 publications
(30 citation statements)
references
References 30 publications
0
29
0
1
Order By: Relevance
“…Literature has specified the use of artificial neural networks (Chung, 1999, Heragu and Kusiak, 1988, Kim and Kim, 2000; construction heuristics such as CORELAP (Lee and Moore, 1967) , ALDEP (Seehof and Evans, 1967), COFAD (Tompkins and Reed, 1976), SHAPE (Hassan, 1994); improvement heuristics such as CRAFT (Armour and Buffa, 1963), FRAT (Khalil, 1973) and DISCON (Drezner, 1987); tabu search algorithms (Chiang and Kouvelis, 1996), simulated annealing algorithms (Chwif et al, 1998, genetic algorithms (Pierreval et al, 2003, Dunker et al, 2005, Balakrishnan et al, 2003, slicing tree (Shayan andChittilappilly, 2004, Wu andAppleton, 2002), space filling curves (Wang et al, 2005), ant colony algorithms (Solimanpur et al, 2005, Baykasoglu et al, 2006 and hybrid genetic algorithms (Mir and Imam, 2001, Balakrishnan et al, 2003.…”
Section: Some Advances In Digital Factory Design Methodsmentioning
confidence: 99%
“…Literature has specified the use of artificial neural networks (Chung, 1999, Heragu and Kusiak, 1988, Kim and Kim, 2000; construction heuristics such as CORELAP (Lee and Moore, 1967) , ALDEP (Seehof and Evans, 1967), COFAD (Tompkins and Reed, 1976), SHAPE (Hassan, 1994); improvement heuristics such as CRAFT (Armour and Buffa, 1963), FRAT (Khalil, 1973) and DISCON (Drezner, 1987); tabu search algorithms (Chiang and Kouvelis, 1996), simulated annealing algorithms (Chwif et al, 1998, genetic algorithms (Pierreval et al, 2003, Dunker et al, 2005, Balakrishnan et al, 2003, slicing tree (Shayan andChittilappilly, 2004, Wu andAppleton, 2002), space filling curves (Wang et al, 2005), ant colony algorithms (Solimanpur et al, 2005, Baykasoglu et al, 2006 and hybrid genetic algorithms (Mir and Imam, 2001, Balakrishnan et al, 2003.…”
Section: Some Advances In Digital Factory Design Methodsmentioning
confidence: 99%
“…Among metaheuristics approaches, one can distinguish global search methods, such as Tabu Search [20] and Simulated Annealing [21], evolutionary methods, such as Ant Colony Optimization [22] and the popular GA [23], and a hybridization of different metaheuristics [24].…”
Section: B Resolution Approachesmentioning
confidence: 99%
“…It has been applied successfully to a wide variety of highly complicated combinatorial optimization problems (Abramson 1991, Chwif, et al 1998, Jayaraman and Ross 2003, Lim, et al 2006, Lin, et al 2007, McKendall Jr., et al 2006, Van Breedam 1995 as well as various real-world problems (Candalino Jr., et al 2004, Kim and Moon 2003, Lee, et al 2007). SA was introduced by Metropolis et al (1953) and popularized by Kirkpatrick et al (1983).…”
Section: Simulated Annealing Heuristic For the Ttrptwmentioning
confidence: 99%