Journal article
Row-Column Aggregation for Rectilinear Distance p -Median Problems
Transportation science, Vol.30(2), pp.160-174
05/01/1996
DOI: 10.1287/trsc.30.2.160
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.
Details
- Title: Subtitle
- Row-Column Aggregation for Rectilinear Distance p -Median Problems
- Creators
- R. L. Francis - University of FloridaT. J. Lowe - University of IowaM. B. Rayco - University of Florida
- Resource Type
- Journal article
- Publication Details
- Transportation science, Vol.30(2), pp.160-174
- DOI
- 10.1287/trsc.30.2.160
- ISSN
- 0041-1655
- eISSN
- 1526-5447
- Number of pages
- 15
- Language
- English
- Date published
- 05/01/1996
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963199502771
Metrics
1 Record Views