2010
DOI: 10.1016/j.cie.2009.11.015
|View full text |Cite
|
Sign up to set email alerts
|

A particle swarm optimization for the single row facility layout problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0
1

Year Published

2013
2013
2020
2020

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 105 publications
(19 citation statements)
references
References 23 publications
0
18
0
1
Order By: Relevance
“…It can be observed from Table 1 that the SA algorithm was able to obtain the optimal solution for small-size SRLP in nearly each run (out of 50 runs). As it can be noted from Table 1 that the proposed SA method was able to obtain the best solution in a reasonable number of function evaluations compared with the GA proposed by Datta, Amaral and Figuiera (2011) and particle swam optimisation (PSO) of Samarghandi, Taabayan and Jahantigh (2010) for SRLP. Solimanpur, Vrat and Shankar (2005) stated that the computational time should not be considered for comparing the performance of different algorithms as the computed machines are different.…”
Section: Computational Resultsmentioning
confidence: 91%
See 2 more Smart Citations
“…It can be observed from Table 1 that the SA algorithm was able to obtain the optimal solution for small-size SRLP in nearly each run (out of 50 runs). As it can be noted from Table 1 that the proposed SA method was able to obtain the best solution in a reasonable number of function evaluations compared with the GA proposed by Datta, Amaral and Figuiera (2011) and particle swam optimisation (PSO) of Samarghandi, Taabayan and Jahantigh (2010) for SRLP. Solimanpur, Vrat and Shankar (2005) stated that the computational time should not be considered for comparing the performance of different algorithms as the computed machines are different.…”
Section: Computational Resultsmentioning
confidence: 91%
“…Table 1 shows these problems with the corresponding average transportation cost function and the best-known optimal solution obtained by previous works (Datta, Amaral, and Figuiera 2011;Amaral 2009;Samarghandi, Taabayan, and Jahantigh 2010;Samarghandi and Eshghi 2010). Table 1 shows these problems with the corresponding average transportation cost function and the best-known optimal solution obtained by previous works (Datta, Amaral, and Figuiera 2011;Amaral 2009;Samarghandi, Taabayan, and Jahantigh 2010;Samarghandi and Eshghi 2010).…”
Section: Computational Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The boundary constraints in some applications may be specified as a single row of modules of constant width [36,37], as multiple rows [38], or as a rectangle [39]. In contrast, numerous FLP applications do not impose any boundary constraint and permit a layout design in an open space [1,[10][11][12][13][14]40].…”
Section: Literature Surveymentioning
confidence: 99%
“…The enclosing area constraint may be imposed to obtain the optimal layouts with a given rectangular, a single row (Samarghandi, 2010;Anjos, 2009), or multiple rows (Ficko, 2010). On the other hand, facility layout problems with open space (Mir, 2001) do not impose any constraint on the enclosing area.…”
Section: Introductionmentioning
confidence: 99%