IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v246y2016i1d10.1007_s10479-014-1699-y.html
   My bibliography  Save this article

Sequential location of two facilities: comparing random to optimal location of the first facility

Author

Listed:
  • Tammy Drezner

    (California State University-Fullerton)

  • Zvi Drezner

    (California State University-Fullerton)

Abstract

We investigate sequential location of two facilities. One strategy is to locate the first facility at its single facility optimum. A second strategy is to randomly locate the first facility. The second facility is then located at its optimal location given the first facility’s location. We investigate which of these two strategies is better. Three objectives are tested: minisum, minimax, and competitive. We considered three environments: uniform demand in a square, discrete demand in the plane, and demand at nodes of a network. For the competitive objective we obtained what might be considered the expected result of locating the first facility optimally is better. For the minisum and minimax objectives, we found a surprising result: it is better to locate the first facility at random. We investigate the reasons behind these results which support the principle of add-heuristics and the greedy randomized adaptive search procedure where the search does not necessarily select the best solution in a greedy sequential approach.

Suggested Citation

  • Tammy Drezner & Zvi Drezner, 2016. "Sequential location of two facilities: comparing random to optimal location of the first facility," Annals of Operations Research, Springer, vol. 246(1), pages 5-18, November.
    • Handle: RePEc:spr:annopr:v:246:y:2016:i:1:d:10.1007_s10479-014-1699-y
    DOI: 10.1007/s10479-014-1699-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-014-1699-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-014-1699-y?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. David L. Huff, 1966. "A Programmed Solution for Approximating an Optimum Retail Location," Land Economics, University of Wisconsin Press, vol. 42(3), pages 293-303.
    2. E. Weiszfeld & Frank Plastria, 2009. "On the point for which the sum of the distances to n given points is minimum," Annals of Operations Research, Springer, vol. 167(1), pages 7-41, March.
    3. Reuven Chen, 1988. "Conditional Minisum and Minimax Location-Allocation Problems in Euclidean Space," Transportation Science, INFORMS, vol. 22(2), pages 157-160, May.
    4. Jack Elzinga & Donald W. Hearn, 1972. "Geometrical Solutions for Some Minimax Location Problems," Transportation Science, INFORMS, vol. 6(4), pages 379-394, November.
    5. 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.
    6. Current, John & Ratick, Samuel & ReVelle, Charles, 1998. "Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach," European Journal of Operational Research, Elsevier, vol. 110(3), pages 597-609, November.
    7. Eiselt, H. A. & Laporte, Gilbert, 1997. "Sequential location problems," European Journal of Operational Research, Elsevier, vol. 96(2), pages 217-231, January.
    8. Zvi Drezner, 1984. "The Planar Two-Center and Two-Median Problems," Transportation Science, INFORMS, vol. 18(4), pages 351-361, November.
    9. Tammy Drezner, 2011. "Cannibalization in a Competitive Environment," International Regional Science Review, , vol. 34(3), pages 306-322, July.
    10. Leon Cooper, 1963. "Location-Allocation Problems," Operations Research, INFORMS, vol. 11(3), pages 331-343, June.
    11. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    12. 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.
    13. Oded Berman & David Simchi-Levi, 1990. "Technical Note—Conditional Location Problems on Networks," Transportation Science, INFORMS, vol. 24(1), pages 77-78, February.
    14. S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, June.
    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. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    2. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
    3. Pawel Kalczynski & Jack Brimberg & Zvi Drezner, 2022. "Less is more: discrete starting solutions in the planar p-median problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 34-59, April.
    4. Jean-Paul Arnaout & John Khoury, 2022. "Adaptation of WO to the Euclidean location-allocation with unknown number of facilities," Annals of Operations Research, Springer, vol. 315(1), pages 57-72, August.
    5. Park, Junseok & Moon, Ilkyeong, 2023. "A facility location problem in a mixed duopoly on networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).

    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. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    2. Zvi Drezner & Said Salhi, 2017. "Incorporating neighborhood reduction for the solution of the planar p-median problem," Annals of Operations Research, Springer, vol. 258(2), pages 639-654, November.
    3. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.
    4. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2019. "A directional approach to gradual cover," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 70-93, April.
    5. Drezner, Zvi & Eiselt, H.A., 2024. "Competitive location models: A review," European Journal of Operational Research, Elsevier, vol. 316(1), pages 5-18.
    6. 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.
    7. 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.
    8. Milosav Georgijevic & Sanja Bojic & Dejan Brcanov, 2013. "The location of public logistic centers: an expanded capacity-limited fixed cost location-allocation modeling approach," Transportation Planning and Technology, Taylor & Francis Journals, vol. 36(2), pages 218-229, April.
    9. 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.
    10. Zvi Drezner & Mozart B. C. Menezes, 2016. "The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution," Annals of Operations Research, Springer, vol. 246(1), pages 205-226, November.
    11. 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.
    12. Zvi Drezner & Vladimir Marianov & George O. Wesolowsky, 2016. "Maximizing the minimum cover probability by emergency facilities," Annals of Operations Research, Springer, vol. 246(1), pages 349-362, November.
    13. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    15. Jing Yao & Alan T. Murray, 2014. "Locational Effectiveness of Clinics Providing Sexual and Reproductive Health Services to Women in Rural Mozambique," International Regional Science Review, , vol. 37(2), pages 172-193, April.
    16. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    17. R. Chen & Y. Handler, 1993. "The conditional p‐center problem in the plane," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 117-127, February.
    18. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    19. Frank Plastria, 2016. "Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams," Annals of Operations Research, Springer, vol. 246(1), pages 227-251, November.
    20. M. Akyüz & İ. Altınel & Temel Öncan, 2014. "Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 222(1), pages 45-71, November.

    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:246:y:2016:i:1:d:10.1007_s10479-014-1699-y. 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.