.png){kind=icon}
返回
Optimal location with equitable loads
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-008-0339-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem considered in this paper is to find p locations for p facilities such that the weights attracted to each facility will be as close as possible to one another. We model this problem as minimizing the maximum among all the total weights attracted to the various facilities. We propose solution procedures for the problem on a network, and for the special cases of the problem on a tree or on a path. The complexity of the problem is analyzed, O(n) algorithms and an O(pn (3)) dynamic programming algorithm are proposed for the problem on a path respectively for p=2 and p > 2 facilities. Heuristic algorithms (two types of a steepest descent approach and tabu search) are proposed for its solution. Extensive computational results are presented.
Keyword:
Equitable loads
Facility location
Network
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
Comparison of consumed portion sizes and on-pack serving sizes of UK energy dense foods.png)
Appetite
OAAI
AppetiteIF0
OAAI分享收藏
查看更多内容