Skip to main content
SpringerLink
Log in

Fast metaheuristics for the discrete (r|p)-centroid problem

  • Two-Level Programming Problems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

An Erratum to this article was published on 15 July 2014

Abstract

Two players, the leader and his competitor, open facilities, striving to capture the largest market share. The leader opens p facilities, then the follower opens r facilities. Each client chooses the nearest facility as his supplier. We need to choose p facilities of the leader in such a way as to maximize his market share. This problem can be represented as a bilevel programming problem. Based on this representation, in this work we propose two numerical approaches: local search with variable neighborhoods and stochastic tabu search. We pay the most attention to improving the methods’ efficiency at no loss to the quality of the resulting solutions. Results of numerical experiments support the possibility to quickly find an exact solution for the problem and solutions with small error.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Facility Location. A Survey of Applications and Methods, Drezner, Z., Ed., Berlin: Springer, 1995.

    Google Scholar 

  2. Hotelling, H., Stability in Competition, Econ. J., 1929, vol. 39, pp. 41–57.

    Article  Google Scholar 

  3. 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 

  4. Kress, D. and Pesch, E., Sequential Competitive Location on Networks, Eur. J. Oper. Res., 2012, vol. 217, pp. 483–499.

    Article  MATH  MathSciNet  Google Scholar 

  5. Beresnev, V. and Mel’nikov, A., Approximate Algorithms for the Competitive Facility Location Problem, J. Appl. Ind. Math., 2011, vol. 5, no. 2, pp. 180–190.

    Article  MathSciNet  Google Scholar 

  6. Alekseeva, E., Kochetova, N., Kochetov, Y., et al., A Heuristic and Exact Methods for the Discrete (r|p)-Centroid Problem, LNCS, 2010, vol. 6022, pp. 11–22.

    MathSciNet  Google Scholar 

  7. Alekseeva, E. and Kochetov, Y., Metaheuristics and Exact Methods for the Discrete (r|p)-Centroid Problem, in Metaheuristics for Bi-Level Optimization, Talbi, E.-G. and Brotcorne, L., Eds., Berlin: Springer, 2013.

    Google Scholar 

  8. Kochetov, Y.A., Facility Location: Discrete Models and Local Search Methods, in Combinatorial Optimization. Methods and Applications, Chvatal, V., Ed., Amsterdam: IOS Press, 2011, pp. 97–134.

    Google Scholar 

  9. Noltemeier, H., Spoerhase, J., and Wirth, H., Multiple Voting Location and Single Voting Location on Trees, Eur. J. Oper. Res., 2007, vol. 181, pp. 654–667.

    Article  MATH  MathSciNet  Google Scholar 

  10. Spoerhase, J. and Wirth, H., (r, p)-Centroid Problems on Paths and Trees, J. Theor. Comput. Sci. Archive, 2009, vol. 410, pp. 5128–5137.

    Article  MATH  MathSciNet  Google Scholar 

  11. Davydov, I., Kochetov, Y., and Carrizosa, E., A Local Search Heuristic for the (r|p)-Centroid Problem in the Plane, Comput. Oper. Res., 2013, DOI:10.1016/j.cor.2013.05.003.

    Google Scholar 

  12. Davydov, I., Kochetov, Y., and Plyasunov, A., On the Complexity of the (r|p)-Centroid Problem on the Plane, TOP, 2013, doi:10.1007/s11750-013-0275-y.

    Google Scholar 

  13. Campos Rodríguez, C.M., Santos Peñate, D.R., and Moreno Perez, J.A., An Exact Procedure and LP Formulations for the Leader-Follower Location Problem, TOP, 2010, vol. 18, no. 1, pp. 97–121.

    Article  MATH  MathSciNet  Google Scholar 

  14. Roboredo, M.C. and Pessoa, A.A., A Branch-and-Cut Algorithm for the Discrete (r|p)-Centroid Problem, Eur. J. Oper. Res., 2013, vol. 224, no. 1, pp. 101–109.

    Article  MathSciNet  Google Scholar 

  15. Benati, S. and Laporte, G., Tabu Search Algorithms for the (r|X p )-Medianoid and (r|p)-Centroid Problems, Locat. Sci., 1994, vol. 2, no. 2, pp. 193–204.

    MATH  Google Scholar 

  16. Davydov, I.A., Local Tabu Search for the Discrete (r|p)-Centroid Problem, Diskret. Anal. Issled. Oper., 2012, vol. 19, no. 2, pp. 19–40.

    Google Scholar 

  17. Campos Rodríguez, C.M., Moreno Pérez, J.A., and Santos Peñate, D.R., Particle Swarm Optimization with Two Swarms for the Discrete (r|p)-Centroid problem, LNCS, 2012, vol. 6927, pp. 432–439.

    Google Scholar 

  18. Mladenović, N., Brimberg, J., Hansen, P., and Moreno-Pérez, J.A., The p-Median Problem: A Survey of Metaheuristic Approaches, Eur. J. Oper. Res., 2007, vol. 179, pp. 927–939

    Article  MATH  Google Scholar 

  19. Talbi, E-G., Metaheuristics: From Design to Implementation, Berlin: Wiley, 2009.

    Book  Google Scholar 

  20. Mladenović, N. and Hansen, P., Variable Neighbourhood Search, Comput. Oper. Res., 1997, vol. 24, pp. 1097–1100.

    Article  MATH  MathSciNet  Google Scholar 

  21. Glover, F. and Laguna, M., Tabu Search, Dordrecht: Kluwer, 1997.

    Book  MATH  Google Scholar 

  22. Brimberg, J., Hansen, P., and Mladenović, N., Attraction Probabilities in Variable Neighborhood Search, 4OR, 2010, vol. 8, no. 2, pp. 181–194.

    Article  MATH  MathSciNet  Google Scholar 

  23. Resende, M.G.C. and Werneck, P.F., A Hybrid Heuristic for the p-Median Problem, J. Heurist., 2004, vol. 10, pp. 59–88.

    Article  MATH  Google Scholar 

  24. Roksandic, S., Carrizosa, E., Urosevic, D., and Mladenović, N., Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics, Electron. Notes Discret. Math., 2012, vol. 39, no. 1, pp. 121–128.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, Novosibirsk, Russia

    I. A. Davydov & Yu. A. Kochetov

  2. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia

    I. A. Davydov & Yu. A. Kochetov

  3. Mathematical Institute of the Serbian Academy of Sciences and Arts, Belgrade, Serbia

    N. Mladenovic & D. Urosevic

Authors
  1. I. A. Davydov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. A. Kochetov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Mladenovic
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. Urosevic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. A. Davydov.

Additional information

Original Russian Text © I.A. Davydov, Yu. A. Kochetov, N. Mladenovic, D. Urosevic, 2014, published in Avtomatika i Telemekhanika, 2014, No. 4, pp. 106–119.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Davydov, I.A., Kochetov, Y.A., Mladenovic, N. et al. Fast metaheuristics for the discrete (r|p)-centroid problem. Autom Remote Control 75, 677–687 (2014). https://doi.org/10.1134/S0005117914040080

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117914040080

Keywords

Search

Navigation