Advertisement

Automation and Remote Control

, Volume 75, Issue 4, pp 700–714 | Cite as

Randomized local search for the discrete competitive facility location problem

  • A. A. Mel’nikovEmail author
Two-Level Programming Problems

Abstract

Consider a finite set of consumers that two competing companies are willing to service. The companies open facilities one by one. The set of locations available to open facilities is finite. The problem is to find a facility location for the first company that maximizes its profit given that the second company also makes its decision by maximizing the profit. We propose a randomized local search scheme that employs an internal local search procedure to estimate the solutions being enumerated. Numerical experiments with random input data show that the scheme is able to find high quality approximate solutions for examples with dimension that has not been amenable to previously known algorithms.

Keywords

Local Search Remote Control Facility Location Facility Location Problem Admissible Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Krarup, J. and Pruzan, P.M., The Simple Plant Location Problem: Survey and Synthesis, Eur. J. Oper. Res., 1983, vol. 12, no. 1, pp. 36–81.CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Kononov, A.V., Kochetov, Y.A., and Plyasunov, A.V., Competitive Facility Location Models, Comput. Math. Math. Phys., 2009, vol. 49, no. 6, pp. 994–1009.CrossRefMathSciNetGoogle Scholar
  3. 3.
    Canovas, L., Garcia, S., Labbe, M., and Marin, A., A Strengthened Formulation for the Simple Plant Location Problem with Order, Oper. Res. Lett., 2007, vol. 35, pp. 141–150.CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Vasil’ev, I.L. and Klimentova, K.B., The Branch and Cut Method for the Facility Location Problem with Client’s Preferences, J. Appl. Ind. Math., 2010, vol. 4, no. 3, pp. 441–454.CrossRefMathSciNetGoogle Scholar
  5. 5.
    Labbe, M. and Hakimi, S.L., Market and Locational Equilibrium for Two Competitors, Oper. Res., 1991, vol. 39, no. 5, pp. 749–756.CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Rhim, H., Ho, T.H., and Karmarkar, U.S., Competitive Location, Production, and Market Selection, Eur. J. Oper. Res., 2003, vol. 149, pp. 211–228.CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Perez, M.D.G., Hernandez, P.F., and Pelegrin, B., On Price Competition in Location-Price Models with Spatially Separated Markets, Top, 2004, vol. 12, no. 2, pp. 351–374.CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Stackelberg, H., The Theory of the Market Economy, Oxford: Oxford Univ. Press, 1952.Google Scholar
  9. 9.
    Hakimi, S.L., Locations with Spatial Interactions: Competitive Locations and Games, in Discrete Location Theory, Mirchandani, P.B. and Francis, R.L., Eds., London: Wiley, 1990, pp. 439–478.Google Scholar
  10. 10.
    Alekseeva, E., Kochetova, N., Kochetov, Y., and Plyasunov, A., Heuristic and Exact Methods for the Discrete (r|p)-Centroid Problem, Lecture Notes Comput. Sci., Berlin: Springer, 2010, vol. 6022, pp. 11–22.Google Scholar
  11. 11.
    Spoerhose, J., Competitive and Voting Location, PhD Dissertation, Univ. of Wurzburg, 2010.Google Scholar
  12. 12.
    Dobson, G. and Karmarkar, U., Competitive Location on Network, Oper. Res., 1987, vol. 35, no. 5, pp. 65–74.CrossRefMathSciNetGoogle Scholar
  13. 13.
    Beresnev, V.L., Upper Bounds for Objective Functions of Discrete Competitive Facility Location Problems, J. Appl. Ind. Math., 2009, vol. 3, pp. 419–432.CrossRefMathSciNetGoogle Scholar
  14. 14.
    Beresnev, V.L. and Melnikov, A.A., Approximate Algorithms for Competitive Facility Location Problem, J. Appl. Ind. Math., 2011, vol. 5, no. 2, pp. 180–190.CrossRefMathSciNetGoogle Scholar
  15. 15.
    Beresnev, V.L., Goncharov, E.N., and Mel’nikov, A.A., Local Search with a Generalized Neighborhood in the Optimization Problem for Pseudo-Boolean Functions, J. Appl. Ind. Math., 2012, no. 1, pp. 22–30.Google Scholar
  16. 16.
    Kernigan, B.W. and Lin, S., An Efficient Heuristic Procedure for Partitioning Graphs, Bell Syst. Tech. J., 1970, vol. 49, pp. 291–307.CrossRefGoogle Scholar
  17. 17.
    Discrete Location Problems: Benchmark Library, http://math.nsc.ru/AP/benchmarks/index.html.
  18. 18.
    Yao, A., Probabilistic Computations: Toward a Unified Measure of Complexity, Proc. 18th IEEE Symp. on Foundat. Comput. Sci. (FOCS), 1977, pp. 222–227.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2014

Authors and Affiliations

  1. 1.Novosibirsk State UniversityNovosibirskRussia

Personalised recommendations