.png){kind=icon}
返回
Solving facility layout problems with strict geometric constraints using a two-phase genetic algorithm
.png){kind=icon}
OA
AI
DOI：10.1080/00207540701666253.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article puts forward a two-phase genetic algorithm that is able to solve facility layout problems strictly respecting the geometric constraints imposed on activities. In the first phase the algorithm attempts to locate an optimum slicing tree to group the activities appropriately. In the second phase the layout is obtained from this tree. In order to assess the slicing trees in the first phase we propose an evaluation function able to predict if, by making the appropriate cuts, the tree structure is able to generate layouts that satisfy the geometric restrictions imposed on the facilities to be arranged, and to minimize the cost of transporting materials between the production activities. It also permits the determination of the most suitable aspect ratio of the layout zone in order to minimize non-compliance with the geometric restrictions. The algorithm and the method of calculating the indicator proposed in the evaluation function are described, and the results obtained in the experiments carried out are also given.
Keyword:
slicing tree
layout problem
genetic algorithm
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
查看更多内容