IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v50y2003i6p614-637.html
   My bibliography  Save this article

Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems

Author

Listed:
  • R.L. Francis
  • T.J. Lowe
  • M.B. Rayco
  • A. Tamir

Abstract

When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of centroid aggregations for rectilinear 1‐median problems. The objective is to construct an aggregation that minimizes the maximum aggregation error. We focus on row‐column aggregations, and make use of aggregation results for 1‐median problems on the line to do aggregation for 1‐median problems in the plane. The aggregations developed for the 1‐median problem are then used to construct approximate n‐median problems. We test the theory computationally on n‐median problems (n ≥ 1) using both randomly generated, as well as real, data. Every error measure we consider can be well approximated by some power function in the number of aggregate demand points. Each such function exhibits decreasing returns to scale. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 614–637, 2003.

Suggested Citation

  • R.L. Francis & T.J. Lowe & M.B. Rayco & A. Tamir, 2003. "Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(6), pages 614-637, September.
    • Handle: RePEc:wly:navres:v:50:y:2003:i:6:p:614-637
    DOI: 10.1002/nav.10079
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10079
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10079?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Paul D. Domich & Karla L. Hoffman & Richard H. F. Jackson & Marjorie A. McClain, 1991. "Locating Tax Facilities: A Graphics-Based Microcomputer Optimization Model," Management Science, INFORMS, vol. 37(8), pages 960-979, August.
    2. Zhao, Peiwu & Batta, Rajan, 1999. "Analysis of centroid aggregation for the Euclidean distance p-median problem," European Journal of Operational Research, Elsevier, vol. 113(1), pages 147-168, February.
    3. Frank Plastria, 2001. "On the choice of aggregation points for continuousp-median problems: A case for the gravity centre," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 217-242, December.
    4. David F. Rogers & Robert D. Plante & Richard T. Wong & James R. Evans, 1991. "Aggregation and Disaggregation Techniques and Methodology in Optimization," Operations Research, INFORMS, vol. 39(4), pages 553-582, August.
    5. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. R. Francis & T. Lowe & M. Rayco & A. Tamir, 2009. "Aggregation error for location models: survey and analysis," Annals of Operations Research, Springer, vol. 167(1), pages 171-208, March.
    2. Richard Francis & Timothy Lowe, 2014. "Comparative error bound theory for three location models: continuous demand versus discrete demand," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 144-169, April.
    3. Francis, R. L. & Lowe, T. J. & Tamir, A. & Emir-Farinas, H., 2004. "A framework for demand point and solution space aggregation analysis for location models," European Journal of Operational Research, Elsevier, vol. 159(3), pages 574-585, December.
    4. Qi, Lian & Shen, Zuo-Jun Max, 2010. "Worst-case analysis of demand point aggregation for the Euclidean p-median problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 434-443, April.
    5. H. Emir-Farinas & R. Francis, 2005. "Demand Point Aggregation for Planar Covering Location Models," Annals of Operations Research, Springer, vol. 136(1), pages 175-192, April.
    6. Irawan, Chandra Ade & Salhi, Said & Scaparra, Maria Paola, 2014. "An adaptive multiphase approach for large unconditional and conditional p-median problems," European Journal of Operational Research, Elsevier, vol. 237(2), pages 590-605.
    7. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    8. Wilhelm, Wilbert E. & Xu, Kaihong, 2002. "Prescribing product upgrades, prices and production levels over time in a stochastic environment," European Journal of Operational Research, Elsevier, vol. 138(3), pages 601-621, May.
    9. Patricia Domínguez-Marín & Stefan Nickel & Pierre Hansen & Nenad Mladenović, 2005. "Heuristic Procedures for Solving the Discrete Ordered Median Problem," Annals of Operations Research, Springer, vol. 136(1), pages 145-173, April.
    10. Vicens, E. & Alemany, M. E. & Andres, C. & Guarch, J. J., 2001. "A design and application methodology for hierarchical production planning decision support systems in an enterprise integration context," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 5-20, December.
    11. Merrick, James H. & Bistline, John E.T. & Blanford, Geoffrey J., 2024. "On representation of energy storage in electricity planning models," Energy Economics, Elsevier, vol. 136(C).
    12. Srinivasa, Anand V. & Wilhelm, Wilbert E., 1997. "A procedure for optimizing tactical response in oil spill clean up operations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 554-574, November.
    13. Kim, Kwang Jae & Moskowitz, Herbert & Koksalan, Murat, 1996. "Fuzzy versus statistical linear regression," European Journal of Operational Research, Elsevier, vol. 92(2), pages 417-434, July.
    14. Murwan Siddig & Yongjia Song, 2022. "Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse," Computational Optimization and Applications, Springer, vol. 81(1), pages 201-250, January.
    15. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    16. Sheikh-Zadeh, Alireza & Rossetti, Manuel D. & Scott, Marc A., 2021. "Performance-based inventory classification methods for large-Scale multi-echelon replenishment systems," Omega, Elsevier, vol. 101(C).
    17. Winterfeld, Anton, 2008. "Application of general semi-infinite programming to lapidary cutting problems," European Journal of Operational Research, Elsevier, vol. 191(3), pages 838-854, December.
    18. Afshartous, David & Guan, Yongtao & Mehrotra, Anuj, 2009. "US Coast Guard air station location with respect to distress calls: A spatial statistics and optimization based methodology," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1086-1096, August.
    19. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    20. Young Woong Park, 2021. "Optimization for L 1 -Norm Error Fitting via Data Aggregation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 120-142, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:50:y:2003:i:6:p:614-637. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.