.png){kind=icon}
返回
A Tabu search algorithm for solving the extended maximal availability location problem
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2011.00824.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The aim of this study is to develop a Tabu Search (TS) procedure for the Extended Maximal Availability Location Problem (EMALP). This probabilistic location problem consists of locating the servers of the system so that the expected coverage of demand is maximized, in which a demand area is said to be covered if there is at least one server available within a given critical distance with a probability greater than or equal to a given reliability. The results obtained from this procedure are compared with those obtained from the Simulated Annealing (SA) procedure developed by Galvao et al. for the same problem. To the best of our knowledge, we are not aware of other methods proposed in the literature to solve the EMALP. The computational results show that in terms of the quality of the solutions, SA slightly outperforms TS for the smaller networks, while TS outperforms SA for the larger networks.
Keyword:
probabilistic location models
maximal availability location
congested emergency systems
hypercube model
tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
Analysis of climate record breaking temperature events in China during the past 50 years中国近50年气候记录破纪录高温事件的统计分析
OAAI
OAAI分享收藏Comparison of consumed portion sizes and on-pack serving sizes of UK energy dense foods.png)
Appetite
OAAI
AppetiteIF0
OAAI分享收藏
查看更多内容