2017
DOI: 10.1007/s40092-017-0222-x
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands

Abstract: This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algorithm is proposed by combining the simulated annealing and clonal selection algorithms. The proposed model and the hyb… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 51 publications
0
4
0
Order By: Relevance
“…Most often, the methodology has been selected based on the nature and number of solutions of the search space. And also, the algorithms are combined to bring forth added advantages due to hybridization [44,45]. On these considerations of the simplicity of SAA and the exhaustive search capability of GA, this paper proposes hybrid heuristic (HH) based on SAA-GA for finding an optimal/near optimal solution.…”
Section: Solution Methodology: Hybrid Heuristic Saa Embedded With Gamentioning
confidence: 99%
“…Most often, the methodology has been selected based on the nature and number of solutions of the search space. And also, the algorithms are combined to bring forth added advantages due to hybridization [44,45]. On these considerations of the simplicity of SAA and the exhaustive search capability of GA, this paper proposes hybrid heuristic (HH) based on SAA-GA for finding an optimal/near optimal solution.…”
Section: Solution Methodology: Hybrid Heuristic Saa Embedded With Gamentioning
confidence: 99%
“…Unlike other metaheuristics, SA is simple to implement, and is computationally more efficient one, but it gives a single solution for each run. Due to the simplicity in implementation of SA, many researchers applied SA to facility layout problems (Tam, 1992;Baykasoglu and Gindy, 2001;McKendall et al, 2006;Pillai et al, 2011;Kulturel-Konak and Konak, 2015;Hunagund et al, 2018;Moslemipour, 2018). In the present study also, SA heuristic is applied to solve the proposed robust approach UA-DFLP with FBS formulation.…”
Section: Dynamic Unequal Area Facility Layout Problem In Continuous Spacementioning
confidence: 97%
“…Rosenblatt (1986) was the first researcher to deal with the DFLPs. Then onwards, many researchers have solved the equal area DFLPs with various meta-heuristics by adaptive approach (Baykasoglu and Gindy, 2001;McKendall et al, 2006;Lacksonen and Enscore, 1993;Balakrishnan et al, 2000;Balakrishnan et al, 2003;Chan et al, 2004;Pourvaziri and Naderi, 2014;Moslemipour, 2018). A few researchers considered the UA-DFLPs with fixed dimension for facilities (Dunker et al, 2005;McKendall and Hakobyan, 2010;Derakhshan Asl and Wong, 2017;Liu et al, 2017), and flexible dimensions for facilities (Lacksonen, 1994(Lacksonen, , 1997Kulturel-Konak and Konak, 2015;Kulturel-Konak, 2017) without FBS in the layout.…”
Section: Static Unequal Area Facility Layout Problem In Continuous Spacementioning
confidence: 99%
“…8 Particle swarm optimization (PSO) has shown strong performance compared with other competing algorithms 9 owing to the simple implementation, few parameters setting, and effective global search. 10 However, PSO is prone to get stuck in local optimum when applied to the complex and combinatorial optimization problem. The exploration (global search across the entire search domain) and exploitation (local search) of PSO should be enhanced and balanced to obtain a better solution.…”
Section: Introductionmentioning
confidence: 99%