Single facility collection depots location problem with random weights

被引：6
|
作者：
Chen, Dongyan [1 ,2 ]
He, Chan [1 ,2 ]
Wu, Senlin [1 ]
机构：
[1] Harbin Univ Sci & Technol, Dept Appl Math, Harbin 150080, Peoples R China
[2] Harbin Univ Sci & Technol, Coll Management, Harbin 150080, Peoples R China
来源：
OPERATIONAL RESEARCH | 2016年 / 16卷 / 02期
关键词：
Collection depot; Facility location; Minimax problem; Stochastic weights; PLANE;
D O I：
10.1007/s12351-015-0200-2
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we consider the single facility collection depots location problem in the plane where n weighted demand points and p collection depots are given. The service of a demand point consists of the travel from the facility to the demand point and returning back to the facility through a collection depot which provides the shortest route. The weights are drawn from independent continuous distributions , and the objective is to find the location such that the probability that the maximum weighted distance of the round trip exceeds a threshold is minimized. The problem is formulated and analyzed. Computational experience is reported.
引用
收藏
页码：287 / 299
页数：13
相关论文
共 50 条
12345