.png){kind=icon}
Return
Move based heuristics for the unidirectional loop network layout problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00062-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the loop network layout problem in a manufacturing system where n machines must be placed in n available locations around a loop to minimize the total flow distance. The formulation of the problem results in a quadratic assignment problem which is computationally a very hard problem. We discuss the idea of positional moves and local improvement algorithms based on moves or k-way (particularly 2-way) interchanges. Even though the concept of moves has not found its way into algorithmic design in the existing literature, our computational experimentation with two-move based heuristics indicates uniformly superior performance in comparison to the well known pairwise interchange heuristic. (C) 1998 Elsevier Science B.V.
Keywords:
facilities
loop network
layout
quadratic assignment
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave3DCITYDB4BIM: A SYSTEM ARCHITECTURE FOR LINKING BIM SERVER AND 3D CITYDB FOR BIM-GIS-INTEGRATION
OAAI
OAAIShareSave
ShareSaveShareSave no more
no more