.png){kind=icon}
返回
Facility layout design using a multi-objective interactive genetic algorithm to support the DM
.png){kind=icon}
OA
AI
DOI：10.1111/exsy.12064.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The unequal area facility layout problem (UA-FLP) has been addressed by many methods. Most of them only take aspects that can be quantified into account. This contribution presents a novel approach, which considers both quantitative aspects and subjective features. To this end, a multi-objective interactive genetic algorithm is proposed with the aim of allowing interaction between the algorithm and the human expert designer, normally called the decision maker (DM) in the field of UA-FLP. The contribution of the DM's knowledge into the approach guides the complex search process, adjusting it to the DM's preferences. The entire population associated to facility layout designs is evaluated by quantitative criteria in combination with an assessment prepared by the DM, who gives a subjective evaluation for a set of representative individuals of the population in each iteration. In order to choose these individuals, a soft computing clustering method is used. Two interesting real-world data sets are analysed to empirically probe the robustness of these models. The first UA-FLP case study describes an ovine slaughterhouse plant and the second, a design for recycling carton plant. Relevant results are obtained, and interesting conclusions are drawn from the application of this novel intelligent framework.
Keyword:
multi-objective
unequal area facility layout problem
interactive evolutionary computation
facility layout
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
2.6K
被引数:
3.8K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏<title>AIRS science processing system (ASPS): a description of architecture and capabilities</title>
PREAI
分享收藏Handling qualitative aspects in Unequal Area Facility Layout Problem: An Interactive Genetic Algorithm处理不等面积设施布局问题中的定性方面: 交互式遗传算法
PREAI
分享收藏
查看更多内容