IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v167y2009i1p87-10510.1007-s10479-007-0233-x.html
   My bibliography  Save this article

A robust and efficient algorithm for planar competitive location problems

Author

Listed:

Abstract

In this paper we empirically analyze several algorithms for solving a Huff-like competitive location and design model for profit maximization in the plane. In particular, an exact interval branch-and-bound method and a multistart heuristic already proposed in the literature are compared with uego (Universal Evolutionary Global Optimizer), a recent evolutionary algorithm. Both the multistart heuristic and uego use a Weiszfeld-like algorithm as local search procedure. The computational study shows that uego is superior to the multistart heuristic, and that by properly fine-tuning its parameters it usually (in the computational study, always) find the global optimal solution, and this in much less time than the interval branch-and-bound method. Furthermore, uego can solve much larger problems than the interval method. Copyright Springer Science+Business Media, LLC 2009

Suggested Citation

  • J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    • Handle: RePEc:spr:annopr:v:167:y:2009:i:1:p:87-105:10.1007/s10479-007-0233-x
    DOI: 10.1007/s10479-007-0233-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0233-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0233-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Erkut, Erhan & Neuman, Susan, 1989. "Analytical models for locating undesirable facilities," European Journal of Operational Research, Elsevier, vol. 40(3), pages 275-291, June.
    2. Tammy Drezner & Zvi Drezner, 2004. "Finding the optimal solution to the Huff based competitive location model," Computational Management Science, Springer, vol. 1(2), pages 193-208, July.
    3. Pierre Hansen & Dominique Peeters & Denis Richard & Jacques-Francois Thisse, 1985. "The Minisum and Minimax Location Problems Revisited," Operations Research, INFORMS, vol. 33(6), pages 1251-1265, December.
    4. Francisco J. Solis & Roger J.-B. Wets, 1981. "Minimization by Random Search Techniques," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 19-30, February.
    5. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    6. Drezner, Tammy & Drezner, Zvi & Salhi, Said, 2002. "Solving the multiple competitive facilities location problem," European Journal of Operational Research, Elsevier, vol. 142(1), pages 138-151, October.
    7. Zvi Drezner & Atsuo Suzuki, 2004. "The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems," Operations Research, INFORMS, vol. 52(1), pages 128-135, February.
    8. Plastria, Frank, 1992. "GBSSS: The generalized big square small square method for planar single-facility location," European Journal of Operational Research, Elsevier, vol. 62(2), pages 163-174, October.
    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. Redondo, Juana L. & Fernández, José & Arrondo, Aránzazu G. & García, Inmaculada & Ortigosa, Pilar M., 2012. "Fixed or variable demand? Does it matter when locating a facility?," Omega, Elsevier, vol. 40(1), pages 9-20, January.

    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. Rafael Blanquero & Emilio Carrizosa & Amaya Nogales-Gómez & Frank Plastria, 2014. "Single-facility huff location problems on networks," Annals of Operations Research, Springer, vol. 222(1), pages 175-195, November.
    2. T Drezner & Z Drezner, 2008. "Lost demand in a competitive environment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 362-371, March.
    3. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    4. Tammy Drezner, 2009. "Location of retail facilities under conditions of uncertainty," Annals of Operations Research, Springer, vol. 167(1), pages 107-120, March.
    5. Skriver, Anders J. V. & Andersen, Kim Allan, 2003. "The bicriterion semi-obnoxious location (BSL) problem solved by an [epsilon]-approximation," European Journal of Operational Research, Elsevier, vol. 146(3), pages 517-528, May.
    6. 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.
    7. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    8. Zvi Drezner & George O. Wesolowsky & Tammy Drezner, 2004. "The gradual covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 841-855, September.
    9. Tammy Drezner & Zvi Drezner & Atsuo Suzuki, 2019. "A cover based competitive facility location model with continuous demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(7), pages 565-581, October.
    10. Fernandez, Jose & Pelegri'n, Blas & Plastria, Frank & Toth, Boglarka, 2007. "Solving a Huff-like competitive location and design model for profit maximization in the plane," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1274-1287, June.
    11. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2011. "Parallel algorithms for continuous multifacility competitive location problems," Journal of Global Optimization, Springer, vol. 50(4), pages 557-573, August.
    12. Romero-Morales, Dolores & Carrizosa, Emilio & Conde, Eduardo, 1997. "Semi-obnoxious location models: A global optimization approach," European Journal of Operational Research, Elsevier, vol. 102(2), pages 295-301, October.
    13. M. Hakan Akyüz & Temel Öncan & İ. Kuban Altınel, 2019. "Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 279(1), pages 1-42, August.
    14. Fernandez, J. & Fernandez, P. & Pelegrin, B., 2000. "A continuous location model for siting a non-noxious undesirable facility within a geographical region," European Journal of Operational Research, Elsevier, vol. 121(2), pages 259-274, March.
    15. Drezner, Zvi & Drezner, Tammy & Wesolowsky, George O., 2009. "Location with acceleration-deceleration distance," European Journal of Operational Research, Elsevier, vol. 198(1), pages 157-164, October.
    16. Tammy Drezner & Morton O’Kelly & Zvi Drezner, 2023. "Multipurpose shopping trips and location," Annals of Operations Research, Springer, vol. 321(1), pages 191-208, February.
    17. Blanquero, Rafael & Carrizosa, Emilio & Schöbel, Anita & Scholz, Daniel, 2011. "A global optimization procedure for the location of a median line in the three-dimensional space," European Journal of Operational Research, Elsevier, vol. 215(1), pages 14-20, November.
    18. 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.
    19. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, March.
    20. Zvi Drezner & Dawit Zerom, 2024. "A refinement of the gravity model for competitive facility location," Computational Management Science, Springer, vol. 21(1), pages 1-18, June.

    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:spr:annopr:v:167:y:2009:i:1:p:87-105:10.1007/s10479-007-0233-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.