Error-bound driven demand point aggregation for the rectilinear distance p-center model

Error-bound driven demand point aggregation for the rectilinear distance p-center model

0.00 Avg rating—0 Votes
Article ID: iaor19981585
Country: United Kingdom
Volume: 4
Issue: 4
Start Page Number: 213
End Page Number: 235
Publication Date: Dec 1996
Journal: Location Science
Authors: , ,
Keywords: p-centre problem
Abstract:

We present an algorithm for aggregating demand points for the rectilinear distance p-center problem. We solve, to optimality, two ‘projected’ problems and then combine the solutions. The maximum objective function error between true and aggregated problems can be well predicted prior to solving the aggregated problem. We also report on our computational experience.

Reviews

Required fields are marked *. Your email address will not be published.