2013
DOI: 10.1007/s00170-012-4685-z
|View full text |Cite
|
Sign up to set email alerts
|

Metaheuristics for fuzzy dynamic facility layout problem with unequal area constraints and closeness ratings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(4 citation statements)
references
References 35 publications
0
4
0
Order By: Relevance
“…The QAP formulation has been extended to cover unequal area units that can occupy different blocks (Wang, Hu, & Ku, 2005). The discrete representation can also facilitate modelling dynamic layout problems where the layout changes over time (Samarghandi, Taabayan, & Behroozi, 2013). However, this approach is incapable of representing models with other assumptions such as unit orientations (vertically or horizontally), pick up and drop off points, and consideration of required distances among units (Drira et al, 2007).…”
Section: Facility Layout Problemsmentioning
confidence: 99%
“…The QAP formulation has been extended to cover unequal area units that can occupy different blocks (Wang, Hu, & Ku, 2005). The discrete representation can also facilitate modelling dynamic layout problems where the layout changes over time (Samarghandi, Taabayan, & Behroozi, 2013). However, this approach is incapable of representing models with other assumptions such as unit orientations (vertically or horizontally), pick up and drop off points, and consideration of required distances among units (Drira et al, 2007).…”
Section: Facility Layout Problemsmentioning
confidence: 99%
“…Mazinani et al [30] modelled dynamic flexible bay layout and solved the problem using a genetic algorithm. Samarghandi et al [31] focused on metaheuristics for fuzzy DFLP. Hosseini et al [32] proposed a robust and simply structured hybrid technique based on integrating three meta-heuristics: imperialist competitive algorithms, variable neighborhood search, and simulated annealing, to efficiently solve the DFLP.…”
Section: Dynamic Facility Layout Problemmentioning
confidence: 99%
“…the minimization of the material flow and rearrangement costs and the maximization of the adjacency Simulated annealing algorithm requirement and the distance requirement. Samarghandi et al (2013) studied the dynamic layout problem as a problem with two objectives. In their model, the material flow between the facilities was assumed to be expressed as a triangular fuzzy number.…”
Section: Literature Reviewmentioning
confidence: 99%
“…An important issue in designing a plant is to determine an appropriate location for a set of departments on the workshop floor that is usually called the facility layout problem (FLP) (Dunker et al , 2005). The material handling consists of virtually 15%–70% of the production costs; hence, minimizing the material handling costs (MHC) is among common objective functions in the FLP (Samarghandi et al , 2013).…”
Section: Introductionmentioning
confidence: 99%