Solving Health Care Facility Location Problems with New Heuristic Algorithm Method

Solving Health Care Facility Location Problems with New Heuristic Algorithm Method
复制标题

用新的启发式算法方法解决医疗机构选址问题

DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
R. Kazemi
R. Kazemi
中科院分区：
--
文献类型：
--
作者：
Mohammad Taghi Valipour;Arman Nedjati;R. Kazemi

文献摘要

被引文献

相似文献

摘要-近年来，关于医疗保健选址问题有很多保守的说法。在本文中，我们主要关注与设施分配相关的医疗保健应急方面。一些医疗设施的最佳位置是根据覆盖距离的不同而分配的。我们提出了一种改进的粒子群优化算法(IPSO)，作为一种强大的启发式算法来最大化在覆盖范围内分配给设施的种群。将该方法与LINGO软件GA的计算结果进行了比较。比较结果表明，IPSO算法能够在更短的时间内得到更好的解。索引术语-最大覆盖模型、医疗保健
 Abstract—In recent years, there has been much conservation about the issue healthcare location problem. In this paper we focus on emergency aspect of healthcare that related to allocate facilities. The best locations for some health care facilities are allocated according to different covering distances. We present IPSO (Improved Particle swarm optimization), as a powerful heuristic algorithm to maximizes the population assigned to a facility within the coverage distance. The proposed method was compared with the results of the LINGO software, GA. The results of this comparison show that IPSO can achieve better results for the solution in a faster time. Index Terms—Maximum covering model, healthcare