IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v40y2012i1p9-20.html
   My bibliography  Save this article

Fixed or variable demand? Does it matter when locating a facility?

Author

Listed:
  • Redondo, Juana L.
  • Fernández, José
  • Arrondo, Aránzazu G.
  • García, Inmaculada
  • Ortigosa, Pilar M.

Abstract

In most competitive location models available in the literature, it is assumed that the demand is fixed independently of market conditions. However, demand may vary depending on prices, distances to the facilities, etc., especially when the goods are not essential. Taking variable demand into consideration increases the complexity of the problem and, therefore, the computational effort needed to solve it, but it may make the model more realistic. In this paper, a new planar competitive location and design problem with variable demand is presented. By using it, it is shown numerically for the first time in the literature that the assumption of fixed demand influences the location decision very much, and therefore the selection of the type of demand (fixed or variable) must be made with care when modeling location problems. Finally, two methods are presented to cope with the new model, an exact interval branch-and-bound method and an evolutionary algorithm called UEGO (Universal Evolutionary Global Optimizer).

Suggested Citation

  • Redondo, Juana L. & Fernández, José & Arrondo, Aránzazu G. & García, Inmaculada & Ortigosa, Pilar M., 2012. "Fixed or variable demand? Does it matter when locating a facility?," Omega, Elsevier, vol. 40(1), pages 9-20, January.
  • Handle: RePEc:eee:jomega:v:40:y:2012:i:1:p:9-20
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048311000375
    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. Margaret L. Brandeau & Samuel S. Chiu, 1994. "Location of Competing Facilities in a User-Optimizing Environment with Market Externalities," Transportation Science, INFORMS, vol. 28(2), pages 125-140, May.
    2. 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.
    3. Eiselt, H. A. & Laporte, Gilbert, 1997. "Sequential location problems," European Journal of Operational Research, Elsevier, vol. 96(2), pages 217-231, January.
    4. Syam, Siddhartha S. & Côté, Murray J., 2010. "A location-allocation model for service providers with application to not-for-profit health care organizations," Omega, Elsevier, vol. 38(3-4), pages 157-166, June.
    5. H. A. Eiselt & Gilbert Laporte & Jacques-François Thisse, 1993. "Competitive Location Models: A Framework and Bibliography," Transportation Science, INFORMS, vol. 27(1), pages 44-54, February.
    6. Vallada, Eva & Ruiz, Rubén, 2010. "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, Elsevier, vol. 38(1-2), pages 57-67, February.
    7. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    8. Oded Berman & Dmitry Krass, 2002. "Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures," Annals of Operations Research, Springer, vol. 111(1), pages 197-225, March.
    9. Overholts II, Dale L. & Bell, John E. & Arostegui, Marvin A., 2009. "A location analysis approach for military maintenance scheduling with geographically dispersed service areas," Omega, Elsevier, vol. 37(4), pages 838-852, August.
    10. Fernandez, Jose & Pelegri'n, Blas & Plastria, Frank & Toth, Boglarka, 2007. "Solving a Huff-like competitive location and design model for profit maximization in the plane," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1274-1287, June.
    11. Chung, Ji-Won & Oh, Seog-Moon & Choi, In-Chan, 2009. "A hybrid genetic algorithm for train sequencing in the Korean railway," Omega, Elsevier, vol. 37(3), pages 555-565, June.
    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. Wang, Xu & Sun, Huijun & Zhang, Si & Lv, Ying & Li, Tongfei, 2022. "Bike sharing rebalancing problem with variable demand," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    2. Merino, María & Ramirez-Nafarrate, Adrian, 2016. "Estimation of retail sales under competitive location in Mexico," Journal of Business Research, Elsevier, vol. 69(2), pages 445-451.
    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.
    4. Suárez-Vega, Rafael & Gutiérrez-Acuña, José Luis & Rodríguez-Díaz, Manuel, 2019. "Using a productivity function based method to design a new shopping centre," Journal of Retailing and Consumer Services, Elsevier, vol. 51(C), pages 176-185.
    5. Firoozeh Kaveh & Reza Tavakkoli-Moghaddam & Chefi Triki & Yaser Rahimi & Amin Jamili, 2021. "A new bi-objective model of the urban public transportation hub network design under uncertainty," Annals of Operations Research, Springer, vol. 296(1), pages 131-162, January.
    6. Eri Nakamura & Fumitoshi Mizutani, 2019. "Necessary demand and extra demand of public utility product: identification using the stochastic frontier model," Economia e Politica Industriale: Journal of Industrial and Business Economics, Springer;Associazione Amici di Economia e Politica Industriale, vol. 46(1), pages 45-64, March.
    7. Haase, Knut & Müller, Sven, 2013. "Management of school locations allowing for free school choice," Omega, Elsevier, vol. 41(5), pages 847-855.
    8. Deane, Jason & Agarwal, Anurag, 2012. "Scheduling online advertisements to maximize revenue under variable display frequency," Omega, Elsevier, vol. 40(5), pages 562-570.

    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. Fernández, José & Hendrix, Eligius M.T., 2013. "Recent insights in Huff-like competitive facility location and design," European Journal of Operational Research, Elsevier, vol. 227(3), pages 581-584.
    2. Sáiz, M. Elena & Hendrix, Eligius M.T. & Pelegrín, Blas, 2011. "On Nash equilibria of a competitive location-design problem," European Journal of Operational Research, Elsevier, vol. 210(3), pages 588-593, May.
    3. Blanquero, Rafael & Carrizosa, Emilio & G.-Tóth, Boglárka & Nogales-Gómez, Amaya, 2016. "p-facility Huff location problem on networks," European Journal of Operational Research, Elsevier, vol. 255(1), pages 34-42.
    4. Buechel, Berno & Roehl, Nils, 2015. "Robust equilibria in location games," European Journal of Operational Research, Elsevier, vol. 240(2), pages 505-517.
    5. Farahani, Reza Zanjirani & Fallah, Samira & Ruiz, Rubén & Hosseini, Sara & Asgari, Nasrin, 2019. "OR models in urban service facility location: A critical review of applications and future developments," European Journal of Operational Research, Elsevier, vol. 276(1), pages 1-27.
    6. J. Redondo & A. Arrondo & J. Fernández & I. García & P. Ortigosa, 2013. "A two-level evolutionary algorithm for solving the facility location and design (1|1)-centroid problem on the plane with variable demand," Journal of Global Optimization, Springer, vol. 56(3), pages 983-1005, July.
    7. Godinho, Pedro & Dias, Joana, 2010. "A two-player competitive discrete location model with simultaneous decisions," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1419-1432, December.
    8. Rafael Suárez‐Vega & Dolores R. Santos‐Peñate & Pablo Dorta‐González, 2004. "Competitive Multifacility Location on Networks: the (r∣Xp)‐Medianoid Problem," Journal of Regional Science, Wiley Blackwell, vol. 44(3), pages 569-588, August.
    9. Blas Pelegrín & Pascual Fernández & María Dolores García Pérez, 2016. "Profit maximization and reduction of the cannibalization effect in chain expansion," Annals of Operations Research, Springer, vol. 246(1), pages 57-75, November.
    10. Crönert, Tobias & Martin, Layla & Minner, Stefan & Tang, Christopher S., 2024. "Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection," European Journal of Operational Research, Elsevier, vol. 312(3), pages 938-953.
    11. Gentile, José & Alves Pessoa, Artur & Poss, Michael & Costa Roboredo, Marcos, 2018. "Integer programming formulations for three sequential discrete competitive location problems with foresight," European Journal of Operational Research, Elsevier, vol. 265(3), pages 872-881.
    12. Fernandez, Pascual & Pelegrin, Blas & Garcia Perez, Maria Dolores & Peeters, Peter H., 2007. "A discrete long-term location-price problem under the assumption of discriminatory pricing: Formulations and parametric analysis," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1050-1062, June.
    13. B Pelegrín-Pelegrín & P Dorta-González & P Fernández-Hernández, 2011. "Finding location equilibria for competing firms under delivered pricing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 729-741, April.
    14. Roboredo, Marcos Costa & Pessoa, Artur Alves, 2013. "A branch-and-cut algorithm for the discrete (r∣p)-centroid problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 101-109.
    15. Farahani, Reza Zanjirani & Rezapour, Shabnam & Drezner, Tammy & Fallah, Samira, 2014. "Competitive supply chain network design: An overview of classifications, models, solution techniques and applications," Omega, Elsevier, vol. 45(C), pages 92-118.
    16. Caicedo, Felix & Diaz, Alejandra, 2013. "Case analysis of simultaneous concessions of parking meters and underground parking facilities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 49(C), pages 358-378.
    17. Dilek, Hande & Karaer, Özgen & Nadar, Emre, 2018. "Retail location competition under carbon penalty," European Journal of Operational Research, Elsevier, vol. 269(1), pages 146-158.
    18. 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.
    19. Martha-Selene Casas-Ramírez & José-Fernando Camacho-Vallejo & Juan A. Díaz & Dolores E. Luna, 2020. "A bi-level maximal covering location problem," Operational Research, Springer, vol. 20(2), pages 827-855, June.
    20. Thomas Byrne, 2022. "The Stackelberg Game: responses to regular strategies," Papers 2211.06472, arXiv.org.

    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:jomega:v:40:y:2012:i:1:p:9-20. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.