.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
facilities
loop network
layout
quadratic assignment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
A GRAPH-THEORETIC HEURISTIC FOR DESIGNING LOOP-LAYOUT MANUFACTURING SYSTEMS用于设计循环布局制造系统的图论启发式方法
PREAI
分享收藏3DCITYDB4BIM: A SYSTEM ARCHITECTURE FOR LINKING BIM SERVER AND 3D CITYDB FOR BIM-GIS-INTEGRATION
OAAI
OAAI分享收藏
没有更多内容
没有更多内容