A bi-objective median location problem with a line barrier
成果类型：
Article
署名作者：
Klamroth, K; Wiecek, MM
署名单位：
University of Erlangen Nuremberg; University of Copenhagen; Clemson University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.50.4.670.2857
发表日期：
2002
页码：
670-679
关键词：
摘要：
The multiple objective median problem (MOMP) involves locating a new facility with respect to a given set of existing facilities so that a vector of performance criteria is optimized. A variation of this problem is obtained if the existing facilities are situated on two sides of a linear barrier, Such barriers, like rivers. highways, borders. or mountain ranges, are frequently encountered in practice, In this paper, theory of an MOMP with line barriers is developed. As this problem is nonconvex but specially structured. a reduction to a series of convex optimization problems is proposed. The general results lead to a polynomial algorithm for finding the set of efficient solutions. The algorithm is proposed for bicriteria problems with different measures of distance.