Skip to main content

The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2018 (ICCSA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10961))

Included in the following conference series:

Abstract

An entering firm wants to compete for market share in a given area by opening some new facilities selected among a finite set of potential locations. Customers are spatially separated and other firms are already operating in that area. In this paper, we analyse the effect of two different customers’ behavior over the optimal solutions, the Huff and the Pareto-Huff customer choice rules. In the first, the customer splits its demand among all competing facilities according to its attractions. In the second, the customer splits its demand among the facilities that are Pareto optimal with respect to the attraction (to be maximized) and the distance (to be minimized), proportionally to their attractions. So, a competitive facility location problem on discrete space is considered in which an entering firm wants to locate a fixed number of new facilities for market share maximization when both Huff and Pareto-Huff customer behavior are used. In order to solve these two models, a heuristic procedure is proposed to obtain the best solutions, and it is compared with a classical genetic algorithm for a set of real geographical coordinates and population data of municipalities in Spain.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Campos, C.M., Santos-Pe\(\tilde{n}\)ate, D.R., Moreno, J.A.: An exact procedure and LP formulations for the leader-follower location problem. Top 18(1), 97–121 (2010)

    Google Scholar 

  2. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)

    Google Scholar 

  3. Drezner, T., Drezner, Z.: Finding the optimal solution to the Huff based competitive location model. Comput. Manag. Sci. 1(2), 193–208 (2004)

    Article  Google Scholar 

  4. Fernández, P., Pelegrín, B., Lančinskas, A., Žilinskas, J.: New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. Comput. Oper. Res. 79, 12–18 (2017)

    Article  MathSciNet  Google Scholar 

  5. Francis, R.L., Lowe, T.J., Tamir, A.: Demand point aggregation for location models. In: Hamacher, H., Drezner, Z. (eds.) Facility Location: Application and Theory, pp. 207–232 (2002)

    Chapter  Google Scholar 

  6. Friesz, T.: Competitive networks facility location models: a survey. Pap. Reg. Sci. 65, 47–57 (1998)

    Article  Google Scholar 

  7. Hakimi, L.: Location with spatial interactions: competitive locations and games. In: Drezner, Z. (ed.) Facility Location: A Survey of Applications and Methods, pp. 367–386 (1995)

    Google Scholar 

  8. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  9. Huff, D.: Defining and estimating a trade area. J. Mark. 28, 34–38 (1964)

    Article  Google Scholar 

  10. Peeters, P.H., Plastria, F.: Discretization results for the Huff and Pareto-Huff competitive location models on networks. TOP 6, 247–260 (1998)

    Article  MathSciNet  Google Scholar 

  11. ReVelle, C., Eiselt, H., Daskin, M.: A bibliography for some fundamental problem categories in discrete location science. Eur. J. Oper. Res. 184(3), 817–848 (2008)

    Article  MathSciNet  Google Scholar 

  12. Serra, D., Eiselt, H.A., Laporte, G., ReVelle, C.S.: Market capture models under various customer-choice rules. Environ. Plan. B: Plan. Des. 26, 741–750 (1999)

    Article  Google Scholar 

  13. Serra, D., Colomé, R.: Consumer choice and optimal location models: formulations and heuristics. Pap. Reg. Sci. 80(4), 439–464 (2001)

    Article  Google Scholar 

  14. Sinnott, R.W.: Virtues of the haversine. Sky Telescope 68(2), 159 (1984)

    MathSciNet  Google Scholar 

Download references

Acknowledgments

This research has been supported by the Ministry of Economy and Competitiveness of Spain under the research project MTM2015-70260-P, and the Fundación Séneca (The Agency of Science and Technology of the Region of Murcia) under the research project 19241/PI/14, and also by a grant (No. MIP-051/2014) from the Research Council of Lithuania.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pascual Fernández .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fernández, P., Pelegrín, B., Lančinskas, A., Žilinskas, J. (2018). The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2018. ICCSA 2018. Lecture Notes in Computer Science(), vol 10961. Springer, Cham. https://doi.org/10.1007/978-3-319-95165-2_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-95165-2_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-95164-5

  • Online ISBN: 978-3-319-95165-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics