.png){kind=icon}
Return
Hope: A genetic algorithm for the unequal area facility layout problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(97)00100-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we outline a GA based algorithm for solving the single-floor facility layout problem. We consider departments of both equal and unequal sizes. The GAs performance is evaluated using several lest problems available in the literature. The results indicate that GA may provide a better alternative in a realistic environment where the objective is to find a number of reasonably good layouts. The implementation also provides the flexibility of having fixed departments and to interactively modify the layouts produced. (C) 1998 Elsevier Science Ltd. Ail rights reserved.
Keywords:
genetic algorithm
quadratic assignment problem
facility layout problem
heuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
Promotion of Maternal–Infant Mental Health and Trauma-Informed Care During the COVID-19 Pandemic
OAAI
OAAIShareSaveHyaluronate and type III procollagen peptide concentrations in bronchoalveolar lavage fluid as markers of disease activity in farmer's lung..png)
BMJOAAI
BMJIF0
OAAIShareSave
ShareSaveShareSave
View more