.png){kind=icon}
Return
A GRASP algorithm for solving large-scale single row facility layout problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2019.02.009.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The single-row facility layout problem (SRFLP) is an NP-hard problem, which consists of arranging facilities along a straight line in order to minimize the weighted sum of distances between all pairs of facilities. In this paper, an implementation of the Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic is presented to solve large-scale instances of the problem. The novelty of the proposed implementation is that it is endowed with a diversification phase based on frequency memory. The algorithm was tested on 93 instances with sizes up to one thousand facilities. To date, in the literature, there is only one work, which has considered instances of such magnitude. Computational experiments demonstrate the efficiency of the proposed algorithm, which improved the best-known values for 29 out of 93 instances. (C) 2019 Elsevier Ltd. All rights reserved.
Keywords:
GRASP
Facility layout
Manufacturing optimization
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
Cited Papers
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy.png)
Gut
GutIF0
PREAI
ShareSaveShareSaveShareSave
ShareSaveShareSave
View more