.png){kind=icon}
返回
Maximum weight matching and genetic algorithm for fixed-shape facility layout problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540600733527.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To achieve efficient facility design, the problem of finding an initial slicing tree of a complete graph may influence the layout solutions in many ways. We introduce a maximum weight-matching algorithm to generate the slicing tree, which is used as an initial solution. This initial solution produces modifications to generate alternative layouts for further selection. The system employs a genetic algorithm (GA) as the search engine with a relationship weight function to obtain good solutions. The model is proposed to solve a fixed-shape layout problem. The research has made contributions to two areas. First, it defines a quality function for the clustering technique to generate an initial slicing tree. Second, it designs a process for generating layout alternatives that can take predetermined location constraints and weights based on relationships among facilities into consideration. We compare our initial slicing tree GA with other approaches in the literature. In addition, computational results to demonstrate the performance characteristics of our algorithm are also evaluated.
Keyword:
facility layout
floor plan
maximum weight matching
slicing tree
genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
暂无机构信息
引用论文
Rationale for the ASSAIL-MI-trial: a randomised controlled trial designed to assess the effect of tocilizumab on myocardial salvage in patients with acute ST-elevation myocardial infarction (STEMI).png)
Open Heart
OAAI
Open HeartIF0
OAAI分享收藏
分享收藏Gravity assists maneuver in the problem of extension accessible landing areas on the Venus surface
PREAI
分享收藏
查看更多内容