.png){kind=icon}
返回
Solving a class of facility location problems using genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1111/1468-0394.00229.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Locating p facilities to serve a number of customers is a problem in many areas of business. The problem is to determine p facility locations such that the weighted average distance traveled from all the demand points to their nearest facility sites is minimized. A variant of the p-median problem is one in which a maximum distance constraint is imposed between the demand point and its nearest facility location, also known as the p-median problem with maximum distance constraint. In this paper, we apply a fairly new methodology known as genetic algorithms to solve a relatively large sized constrained version of the p-median problem. We present our computational experience on the use of genetic algorithms for solving the constrained version of the p-median problem using two different data sets. Our comparative experimental experience shows that this solution procedure performs quite well compared with the results obtained from existing techniques.
Keyword:
facility location
p-median problem
genetic algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
2.6K
被引数:
3.8K
机构
暂无机构信息
引用论文
Experimental Study on Breakdown Characteristics of Transformer Oil Influenced by Bubbles.png)
Energies
OAAI
EnergiesIF0
OAAI分享收藏Fast and accurate power dispatch using a relaxed genetic algorithm and a local gradient technique
PREAI
分享收藏Protecting Sovereignty, Protecting the Planet: State Delegation to International Organizations and Private Actors in Environmental PoliticsGovernance
GovernanceIF0
PREAI
分享收藏分享收藏
查看更多内容