.png){kind=icon}
返回
A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search
.png){kind=icon}
OA
AI
DOI：10.1007/s10845-019-01468-x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work proposes a new methodology and mathematical formulation to address the facility layout problem. The goal is to minimise the total material handling cost subjected to production-derived constraints. This cost is a function of the distance that the products should cover within the facility. The first idea is to use the A* algorithm to identify the distances between workstations in a more realistic way. A* determines the shortest path within the facility that contains obstacles and transportation routes. The second idea is to combine a genetic algorithm and the A* algorithm with a homogenous methodology to improve the quality of the facility layouts. In an iterative way, the layout solution space is explored using the genetic algorithm. We study the impacts of the appropriate crossover and mutation operators and the values of the parameters used in this algorithm on the cost of the proposed arrangements. These operators and parameter values are fine-tuned using Monte Carlo simulations. The facility arrangements are all compared and discussed based on their material handling cost associated with the Euclidean distance, rectilinear distance, and A* algorithm. Finally, we present a set of conclusions regarding the suggested methodology and discuss our future research goals.
Keyword:
Manufacturing systems design
Facility layout problem
Genetic algorithm
A* search algorithm
Monte Carlo simulation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.4
论文数:
3.5K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏
A non dominated ranking Multi Objective Genetic Algorithm and electre method for unequal area facility layout problems不等面积设施布局问题的非支配排序多目标遗传算法和electre方法
PREAI
分享收藏
查看更多内容