.png){kind=icon}
返回
A particle swarm optimization for the single row facility layout problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2009.11.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Single Row Facility Layout Problem (SRFLP) consists of arranging a number of rectangular facilities with varying length on one side of a straight line to minimize the weighted sum of the distance between all facility pairs. In this paper we use a Particle Swarm Optimization (PSO) algorithm to solve the SRFLP. We first employ a new coding and decoding technique to efficiently map discrete feasible space of the SRFLP to a continuous space. The proposed PSO will further use this coding technique to explore the continuous solution space. Afterwards, the algorithm decodes the solutions to its respective feasible solution in the discrete feasible space and returns the solutions. Computational results on benchmark problems show the efficiency of the proposed algorithm compared to other heuristics. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Facility planning and design
Linear ordering problem
Particle swarm optimization
Factoradics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容