Row-Column Aggregation for Rectilinear Distance p -Median Problems

R. L. Francis, T. J. Lowe and M. B. Rayco
Additional contact information
R. L. Francis: Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
T. J. Lowe: Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242
M. B. Rayco: Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611

Transportation Science, 1996, vol. 30, issue 2, 160-174

Abstract: For large-scale p -median problems, it is common to aggregate the demand points. This size reduction via aggregation makes the problem easier to solve, but introduces error. Doing this aggregation well is provably difficult. We present a median-row-column aggregation algorithm, MRC, with provable properties including an error bound, an (attainable) upper bound on the maximum objective function error. MRC adjusts spacing of individual rows and columns to exploit problem structure. For e demand points, r rows, and c columns, the algorithm has computational order e ( c + r + log e ), and order e storage requirements. We report encouraging computational experience.

Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.30.2.160 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:30:y:1996:i:2:p:160-174

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().