Skip to main content
SpringerLink
Log in

An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2014)

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

Included in the following conference series:

Abstract

The leader-follower facility location problem arises in the context of two non-cooperating companies, a leader and a follower, competing for market share from a given set of customers. In our work we assume that the firms place a given number of facilities on locations taken from a discrete set of possible points. The customers are assumed to split their demand inversely proportional to their distance to all opened facilities. In this work we present an evolutionary algorithm with an embedded tabu search to optimize the location selection for the leader. A complete solution archive is used to detect already visited candidate solutions and convert them into not yet considered ones. This avoids unnecessary time-consuming re-evaluations, reduces premature convergence and increases the population diversity at the same time. Results show significant advantages of our approach over an existing algorithm from the literature.

This work is supported by the Austrian Science Fund (FWF) under grant P24660.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    http://math.nsc.ru/AP/benchmarks/Design/design_en.html

  2. 2.

    www.ads.tuwien.ac.at/w/Research/Problem_Instances#Competitive_Facility_Location_Problems

References

  1. Alekseeva, E., Kochetov, Y.: Matheuristics and exact methods for the discrete (\(\mathit{r}|\mathit{p}\))-centroid problem. In: Talbi, E.-G., Brotcorne, L. (eds.) Metaheuristics for bi-level Optimization. SCI, vol. 482, pp. 189–220. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  2. Alekseeva, E., Kochetova, N., Kochetov, Y., Plyasunov, A.: A hybrid memetic algorithm for the competitive P-median problem. In: Bakhtadze, N., Dolgui, A. (eds.) Information Control Problems in Manufacturing, vol. 13, pp. 1533–1537. International Federation of Automatic Control, Boston (2009)

    Google Scholar 

  3. Alekseeva, E., Kochetova, N., Kochetov, Y., Plyasunov, A.: Heuristic and exact methods for the discrete (\(\mathit{r}|\mathit{p}\))-centroid problem. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 11–22. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Bhadury, J., Eiselt, H., Jaramillo, J.: An alternating heuristic for medianoid and centroid problems in the plane. Comput. Oper. Res. 30(4), 553–565 (2003)

    Article  MATH  Google Scholar 

  5. Fernández, J., Hendrix, E.M.: Recent insights in huff-like competitive facility location and design. Eur. J. Oper. Res. 227(3), 581–584 (2013)

    Article  Google Scholar 

  6. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)

    Book  MATH  Google Scholar 

  7. Hakimi, S.: On locating new facilities in a competitive environment. Eur. J. Oper. Res. 12(1), 29–35 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hotelling, H.: Stability in competition. Econ. J. 39(153), 41–57 (1929)

    Article  Google Scholar 

  9. Hu, B., Raidl, G.: An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. In: Soule, T. (ed.) Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO 2012), pp. 393–400. ACM Press, Philadelphia (2012)

    Google Scholar 

  10. Kochetov, Y., Kochetova, N., Plyasunov, A.: A matheuristic for the leader-follower facility location and design problem. In: Lau, H., Van Hentenryck, P., Raidl, G. (eds.) Proceedings of the 10th Metaheuristics International Conference (MIC 2013), Singapore, pp. 32/1-32/3 (2013)

    Google Scholar 

  11. Kress, D., Pesch, E.: \(( r| p)\)-centroid problems on networks with vertex and edge demand. Comput. Oper. Res. 39, 2954–2967 (2012)

    Article  MathSciNet  Google Scholar 

  12. Küçükaydin, H., Aras, N., Altınel, I.K.: Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution. Eur. J. Oper. Res. 208(3), 206–220 (2011)

    Article  MATH  Google Scholar 

  13. Laporte, G., Benati, S.: Tabu Search Algorithms for the \((r|X_p)\)-medianoid and \((r|p)\)-centroid Problems. Location Sci. 2, 193–204 (1994)

    MATH  Google Scholar 

  14. Louis, S., Li, G.: Combining robot control strategies using genetic algorithms with memory. In: Angeline, P.J., McDonnell, J.R., Reynolds, R.G., Eberhart, R. (eds.) EP 1997. LNCS, vol. 1213, pp. 431–441. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  15. Mauldin, M.: Maintaining diversity in genetic search. In: Brachman, R.J. (ed.) Proceedings of the National Conference on Artificial Intelligence (AAAI-84), Austin, Texas, USA, pp. 247–250 (1984)

    Google Scholar 

  16. Raidl, G.R., Hu, B.: Enhancing genetic algorithms by a trie-based complete solution archive. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 239–251. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Roboredo, M., Pessoa, A.: A branch-and-cut algorithm for the discrete \((r|p)\)-centroid problem. Eur. J. Oper. Res. 224(1), 101–109 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ronald, S.: Preventing diversity loss in a routing genetic algorithm with hash tagging. Complex. Int. 2, 548–553 (1995)

    Google Scholar 

  19. Saidani, N., Chu, F., Chen, H.: Competitive facility location and design with reactions of competitors already in the market. Eur. J. Oper. Res. 219(1), 9–17 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sáiz, M.E., Hendrix, E.M., Pelegrín, B.: On nash equilibria of a competitive location-design problem. Eur. J. Oper. Res. 210(3), 588–593 (2011)

    Article  MATH  Google Scholar 

  21. Suárez-Vega, R., Santos-Peñate, D., Pablo, D.G.: Competitive multifacility location on networks: the \((r| X_p)\)-medianoid problem. J. Reg. Sci. 44(3), 569–588 (2004)

    Article  Google Scholar 

  22. Teitz, M.B., Bart, P.: Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper. Res. 16(5), 955–961 (1968)

    Article  MATH  Google Scholar 

  23. Yuen, S.Y., Chow, C.K.: A non-revisiting genetic algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation, (CEC 2007), pp. 4583–4590. IEEE Press, Singapore (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9-11/1861, 1040, Vienna, Austria

    Benjamin Biesinger, Bin Hu & Günther Raidl

Authors
  1. Benjamin Biesinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bin Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Günther Raidl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Benjamin Biesinger .

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. AT&T Labs Research, Middletown, New Jersey, USA

    Mauricio G.C. Resende

  3. University of Florida, Gainesville, Florida, USA

    Chrysafis Vogiatzis

  4. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Jose L. Walteros

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Biesinger, B., Hu, B., Raidl, G. (2014). An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior. In: Pardalos, P., Resende, M., Vogiatzis, C., Walteros, J. (eds) Learning and Intelligent Optimization. LION 2014. Lecture Notes in Computer Science(), vol 8426. Springer, Cham. https://doi.org/10.1007/978-3-319-09584-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09584-4_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09583-7

  • Online ISBN: 978-3-319-09584-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation