IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v131y2011i2p568-574.html
   My bibliography  Save this article

The maximum capture per unit cost location problem

Author

Listed:
  • Hua, Guowei
  • Cheng, T.C.E.
  • Wang, Shouyang

Abstract

This paper considers the problem of siting p new facilities of an entering firm to a competitive market so as to maximize the market share captured from competitors per unit cost. We first formulate the problem as a mixed 0-1 fractional programming model, in which we incorporate the fixed cost and transportation cost. The model can deal with the case where some demand nodes have two or more possible closest servers. We then re-formulate the problem as a 0-1 mixed integer linear program. We use a one-opt heuristic algorithm based on the Teitz-Bart method to obtain feasible solutions and compare them with the optimal solutions obtained by a branch-and-bound algorithm. We conduct computational experiments to evaluate the two algorithms. The results show that both algorithms can solve the model efficiently and the model is integer-friendly. We discuss other computational results and provide managerial insights.

Suggested Citation

  • Hua, Guowei & Cheng, T.C.E. & Wang, Shouyang, 2011. "The maximum capture per unit cost location problem," International Journal of Production Economics, Elsevier, vol. 131(2), pages 568-574, June.
    • Handle: RePEc:eee:proeco:v:131:y:2011:i:2:p:568-574
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(11)00040-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. D Serra & S Ratick & C ReVelle, 1996. "The Maximum Capture Problem with Uncertainty," Environment and Planning B, , vol. 23(1), pages 49-59, February.
    2. Li, Han-Lin, 1994. "A global approach for general 0-1 fractional programming," European Journal of Operational Research, Elsevier, vol. 73(3), pages 590-596, March.
    3. Serra, Daniel & Marianov, Vladimir & ReVelle, Charles, 1992. "The maximum-capture hierarchical location problem," European Journal of Operational Research, Elsevier, vol. 62(3), pages 363-371, November.
    4. D Serra & H A Eiselt & G Laporte & C S ReVelle, 1999. "Market Capture Models under Various Customer-Choice Rules," Environment and Planning B, , vol. 26(5), pages 741-750, October.
    5. ReVelle, Charles, 1993. "Facility siting and integer-friendly programming," European Journal of Operational Research, Elsevier, vol. 65(2), pages 147-158, March.
    6. Benati, Stefano & Hansen, Pierre, 2002. "The maximum capture problem with random utilities: Problem formulation and algorithms," European Journal of Operational Research, Elsevier, vol. 143(3), pages 518-530, December.
    7. Michael B. Teitz & Polly Bart, 1968. "Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph," Operations Research, INFORMS, vol. 16(5), pages 955-961, October.
    8. Gregory Dobson & Uday S. Karmarkar, 1987. "Competitive Location on a Network," Operations Research, INFORMS, vol. 35(4), pages 565-574, August.
    9. Carrizosa, Emilio & Conde, Eduardo, 2002. "A fractional model for locating semi-desirable facilities on networks," European Journal of Operational Research, Elsevier, vol. 136(1), pages 67-80, January.
    10. Hansen, Pierre & de Luna Pedrosa Filho, Eugenio & Carneiro Ribeiro, Celso, 1994. "Modelling location and sizing of offshore platforms," European Journal of Operational Research, Elsevier, vol. 72(3), pages 602-606, February.
    11. Daniel Serra & Charles Revelle, 1997. "Competitive location and pricing on networks," Economics Working Papers 219, Department of Economics and Business, Universitat Pompeu Fabra.
    12. Daniel Serra & Charles Revelle, 1994. "Competitive location in discrete space," Economics Working Papers 96, Department of Economics and Business, Universitat Pompeu Fabra.
    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. Zhang, Yue, 2015. "Designing a retail store network with strategic pricing in a competitive environment," International Journal of Production Economics, Elsevier, vol. 159(C), pages 265-273.

    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. Diego Ruiz-Hernández & Javier Elizalde & David Delgado-Gómez, 2017. "Cournot–Stackelberg games in competitive delocation," Annals of Operations Research, Springer, vol. 256(1), pages 149-170, September.
    2. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    3. Carreras, Miquel & Serra, Daniel, 1999. "On optimal location with threshold requirements," Socio-Economic Planning Sciences, Elsevier, vol. 33(2), pages 91-103, June.
    4. Daniel Serra & Charles Revelle, 1994. "Competitive location in discrete space," Economics Working Papers 96, Department of Economics and Business, Universitat Pompeu Fabra.
    5. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    6. Benjamin Spaulding & Robert Cromley, 2007. "Integrating the maximum capture problem into a GIS framework," Journal of Geographical Systems, Springer, vol. 9(3), pages 267-288, September.
    7. Francisco Silva & Daniel Serra, 2008. "Incorporating waiting time in competitive location models: Formulations and heuristics," Economics Working Papers 1091, Department of Economics and Business, Universitat Pompeu Fabra.
    8. Stephanie A. Snyder & Robert G. Haight, 2016. "Application of the Maximal Covering Location Problem to Habitat Reserve Site Selection," International Regional Science Review, , vol. 39(1), pages 28-47, January.
    9. Küçükaydin, Hande & Aras, Necati & Kuban AltInel, I., 2011. "Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution," European Journal of Operational Research, Elsevier, vol. 208(3), pages 206-220, February.
    10. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, March.
    11. Francisco Silva & Daniel Serra, 2007. "Incorporating Waiting Time in Competitive Location Models," Networks and Spatial Economics, Springer, vol. 7(1), pages 63-76, March.
    12. Verónica Durán-Carbó & Charles ReVelle & Daniel Serra, 2006. "Spatial market expansion through mergers," Economics Working Papers 960, Department of Economics and Business, Universitat Pompeu Fabra.
    13. Haase, Knut & Hoppe, Mirko, 2008. "Standortplanung unter Wettbewerb - Teil 1: Grundlagen," Discussion Papers 2/2008, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    14. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Jackson, Laura E. & Rouskas, George N. & Stallmann, Matthias F.M., 2007. "The directional p-median problem: Definition, complexity, and algorithms," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1097-1108, June.
    16. Ting L. Lei & Richard L. Church, 2011. "Constructs for Multilevel Closest Assignment in Location Modeling," International Regional Science Review, , vol. 34(3), pages 339-367, July.
    17. Marianov, Vladimir & Serra, Daniel, 2001. "Hierarchical location-allocation models for congested systems," European Journal of Operational Research, Elsevier, vol. 135(1), pages 195-208, November.
    18. Zhang, Yue, 2015. "Designing a retail store network with strategic pricing in a competitive environment," International Journal of Production Economics, Elsevier, vol. 159(C), pages 265-273.
    19. Rosa Colomé & Helena Lourenço & Daniel Serra, 2003. "A New Chance-Constrained Maximum Capture Location Problem," Annals of Operations Research, Springer, vol. 122(1), pages 121-139, September.
    20. K.E. Rosing & C.S. ReVelle, 1997. "Heuristic Concentration and Tabu Search: A Nose to Nose Comparison," Tinbergen Institute Discussion Papers 97-058/3, Tinbergen Institute.

    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:eee:proeco:v:131:y:2011:i:2:p:568-574. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.