IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v7y2007i1p3-18.html
   My bibliography  Save this article

Aggregation without Loss of Optimality in Competitive Location Models

Author

Listed:
  • Frank Plastria

    ()

  • Lieselot Vanhaverbeke

    ()

Abstract

In the context of competitive facility location problems demand points often have to be aggregated due to computational intractability. However, usually this spatial aggregation biases the value of the objective function and the optimality of the solution cannot be guaranteed for the original model. We present a preprocessing aggregation method to reduce the number of demand points which prevents this loss of information, and therefore avoids the possible loss of optimality. It is particularly effective in the frequent situation with a large number of demand points and a comparatively low number of potential facility sites, and coverage defined by spatial nearness. It is applicable to any spatial consumer behaviour model of covering type. This aggregation approach is applied in particular to a Competitive Maximal Covering Location Problem and to a recently developed von Stackelberg model. Some empirical results are presented, showing that the approach may be quite effective. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Frank Plastria & Lieselot Vanhaverbeke, 2007. "Aggregation without Loss of Optimality in Competitive Location Models," Networks and Spatial Economics, Springer, vol. 7(1), pages 3-18, March.
  • Handle: RePEc:kap:netspa:v:7:y:2007:i:1:p:3-18
    DOI: 10.1007/s11067-006-9004-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-006-9004-5
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Plastria, Frank, 2001. "Static competitive facility location: An overview of optimisation approaches," European Journal of Operational Research, Elsevier, vol. 129(3), pages 461-470, March.
    2. Plastria, Frank, 2002. "Formulating logical implications in combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 140(2), pages 338-353, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dominik Kress & Erwin Pesch, 2016. "Competitive Location and Pricing on Networks with Random Utilities," Networks and Spatial Economics, Springer, vol. 16(3), pages 837-863, September.
    2. Paul Berglund & Changhyun Kwon, 2014. "Solving a Location Problem of a Stackelberg Firm Competing with Cournot-Nash Firms," Networks and Spatial Economics, Springer, vol. 14(1), pages 117-132, March.
    3. Pelegrín, Blas & Fernández, Pascual & García Pérez, María Dolores, 2015. "On tie breaking in competitive location under binary customer behavior," Omega, Elsevier, vol. 52(C), pages 156-167.

    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:kap:netspa:v:7:y:2007:i:1:p:3-18. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.