.png){kind=icon}
返回
Applying Ant System for solving Unequal Area Facility Layout Problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2009.06.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ant Colony Optimization (ACO) is a young metaheuristic algorithm which has shown promising results in solving many optimization problems. To date, a formal ACO-based metaheuristic has not been applied for solving Unequal Area Facility Layout Problems (UA-FLPs). This paper proposes an Ant System (AS) (one of the ACO variants) to solve them. As a discrete optimization algorithm, the proposed algorithm uses slicing tree representation to easily represent the problems without too restricting the solution space. It uses several types of local search to improve its search performance. It is then tested using several case problems with different size and setting. Overall, the proposed algorithm shows encouraging results in solving UA-FLPs. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Facility layout
Slicing tree representation
Ant System
Metaheuristic
Unequal Area Facility Layout Problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏STaTS: A Slicing Tree and Tabu Search based heuristic for the unequal area facility layout problem统计: 一种基于切片树和禁忌搜索的启发式方法，用于解决不等面积设施布局问题
PREAI
分享收藏
查看更多内容