In this paper, we study demand point aggregation for planar p-median problem when demand points are arbitrarily distributed. Efficient demand aggregation ...
In this paper, we study demand point aggregation for planar p-median problem when demand points are arbitrarily distributed. Efficient demand aggregation ...
Feb 11, 2021 · Abstract, Solving large-scale p-median problems is usually time consuming. People often aggregate the demand points in a large-scale ...
Lian Qi, Zuo-Jun Max Shen : Worst-case analysis of demand point aggregation for the Euclidean p-median problem. Eur. J. Oper. Res. 202(2): 434-443 (2010).
Dive into the research topics of 'Worst-case analysis of demand point aggregation for the Euclidean p-median problem'. Together they form a unique fingerprint.
People also ask
What is the P-median problem primarily concerned with?
What is the P-median transportation problem?
Demand data aggregation results in loss of information and thereby induces errors in the locational decision being made, both in the facility location ...
Feb 16, 1999 · Worst-case analysis of demand point aggregation for the Euclidean p-median problem. 2010, European Journal of Operational Research. Citation ...
This work proposes new re-aggregation approach, which aggregates the original problem to the size that can be solved by the used optimization algorithm, ...
Qi and Shen [17] studied the worst-case analysis of demand point aggregation for the Euclidean p-median problem on the plane. They utilised a “honeycomb ...
The set V is viewed as the set of customers. (demand points), and S is the set of all possible sites for locating servers (supply points). X is then the set of ...