IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v191y2008i2p437-453.html
   My bibliography  Save this article

Multiple voting location problems

Author

Listed:
  • Campos Rodrí­guez, Clara M.
  • Moreno Pérez, José A.

Abstract

The facility voting location problems arise from the application of criteria derived from the voting processes concerning the location of facilities. The multiple location problems are those location problems in which the alternative solutions are sets of points. This paper extends previous results and notions on single voting location problems to the location of a set of facility points. The application of linear programming techniques to solve multiple facility voting location problems is analyzed. We propose an algorithm to solve Simpson multiple location problems from which the solution procedures for other problems are derived.

Suggested Citation

  • Campos Rodrí­guez, Clara M. & Moreno Pérez, José A., 2008. "Multiple voting location problems," European Journal of Operational Research, Elsevier, vol. 191(2), pages 437-453, December.
    • Handle: RePEc:eee:ejores:v:191:y:2008:i:2:p:437-453
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00895-8
    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. Wendell, R. E. & McKelvey, R. D., 1981. "New perspectives in competitive location theory," European Journal of Operational Research, Elsevier, vol. 6(2), pages 174-182, February.
    2. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    3. Gregory Dobson & Uday S. Karmarkar, 1987. "Competitive Location on a Network," Operations Research, INFORMS, vol. 35(4), pages 565-574, August.
    4. Dionisio Brito & José Moreno Pérez, 2000. "The generalizedp-Centdian on network," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(2), pages 265-285, December.
    5. Campos Rodriguez, Clara M. & Moreno Perez, Jose A., 2003. "Relaxation of the Condorcet and Simpson conditions in voting location," European Journal of Operational Research, Elsevier, vol. 145(3), pages 673-683, March.
    6. HANSEN, Pierre & THISSE, Jacques-François & WENDELL, Richard E., 1990. "Equilibrium analysis for voting and competitive location problems," LIDAM Reprints CORE 898, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. 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.
    2. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    3. Ivan Davydov & Yury Kochetov & Alexandr Plyasunov, 2014. "On the complexity of the (r|p)-centroid problem in the plane," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 614-623, July.

    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. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    2. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    3. Labbe, Martine & Hakimi, S. Louis, 1989. "Market And Locational Equilibrium For Two Competitors," Econometric Institute Archives 272383, Erasmus University Rotterdam.
    4. Rhim, Hosun & Ho, Teck H. & Karmarkar, Uday S., 2003. "Competitive location, production, and market selection," European Journal of Operational Research, Elsevier, vol. 149(1), pages 211-228, August.
    5. Eiselt, H. A. & Laporte, Gilbert, 1997. "Sequential location problems," European Journal of Operational Research, Elsevier, vol. 96(2), pages 217-231, January.
    6. Tsouros, C. & Satratzemi, M., 1996. "Optimal solution of a total time distribution problem," International Journal of Production Economics, Elsevier, vol. 45(1-3), pages 473-478, August.
    7. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    8. Miriam Kießling & Sascha Kurz & Jörg Rambau, 2021. "An exact column-generation approach for the lot-type design problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 741-780, October.
    9. Kenneth Carling & Mengjie Han & Johan Håkansson, 2012. "Does Euclidean distance work well when the p-median model is applied in rural areas?," Annals of Operations Research, Springer, vol. 201(1), pages 83-97, December.
    10. Daniel Serra & Charles Revelle, 1997. "Competitive location and pricing on networks," Economics Working Papers 219, Department of Economics and Business, Universitat Pompeu Fabra.
    11. 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.
    12. Boris Goldengorin & Dmitry Krushinsky & Jannes Slomp, 2012. "Flexible PMP Approach for Large-Size Cell Formation," Operations Research, INFORMS, vol. 60(5), pages 1157-1166, October.
    13. Küçükaydin, Hande & Aras, Necati & Kuban AltInel, I., 2011. "Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution," European Journal of Operational Research, Elsevier, vol. 208(3), pages 206-220, February.
    14. Behrooz Alizadeh & Somayeh Bakhteh, 2017. "A modified firefly algorithm for general inverse p-median location problems under different distance norms," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 618-636, September.
    15. Jacques-François Thisse & Pierre Hanjoul, 1985. "Localisation de la firme sur un réseau," Revue Économique, Programme National Persée, vol. 36(1), pages 63-102.
    16. Tao Zhuolin & Zheng Qingjing & Kong Hui, 2018. "A Modified Gravity p-Median Model for Optimizing Facility Locations," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 421-434, October.
    17. Amir Hossein Sadeghi & Ziyuan Sun & Amirreza Sahebi-Fakhrabad & Hamid Arzani & Robert Handfield, 2023. "A Mixed-Integer Linear Formulation for a Dynamic Modified Stochastic p-Median Problem in a Competitive Supply Chain Network Design," Logistics, MDPI, vol. 7(1), pages 1-24, March.
    18. Blanquero, Rafael & Carrizosa, Emilio & G.-Tóth, Boglárka, 2016. "Maximal Covering Location Problems on networks with regional demand," Omega, Elsevier, vol. 64(C), pages 77-85.
    19. 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.
    20. Buechel, Berno & Roehl, Nils, 2015. "Robust equilibria in location games," European Journal of Operational Research, Elsevier, vol. 240(2), pages 505-517.

    More about this item

    Statistics

    Access and download statistics

    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:ejores:v:191:y:2008:i:2:p:437-453. 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/locate/eor .

    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.