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

The p/q-active uncapacitated facility location problem: Investigation of the solution space and an LP-fitting heuristic

Author

Listed:
  • Dohn, Anders
  • Christensen, Soren Gram
  • Rousoe, David Magid

Abstract

No abstract is available for this item.

Suggested Citation

  • Dohn, Anders & Christensen, Soren Gram & Rousoe, David Magid, 2007. "The p/q-active uncapacitated facility location problem: Investigation of the solution space and an LP-fitting heuristic," European Journal of Operational Research, Elsevier, vol. 180(2), pages 532-546, July.
    • Handle: RePEc:eee:ejores:v:180:y:2007:i:2:p:532-546
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00330-4
    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. Ghosh, Diptesh, 2003. "Neighborhood search heuristics for the uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 150(1), pages 150-162, October.
    2. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    3. Barbaros C. Tansel & Richard L. Francis & Timothy J. Lowe, 1983. "State of the Art---Location on Networks: A Survey. Part I: The p-Center and p-Median Problems," Management Science, INFORMS, vol. 29(4), pages 482-497, April.
    4. Krarup, Jakob & Pruzan, Peter Mark, 1982. "UNILOC : A uni-location model," Regional Science and Urban Economics, Elsevier, vol. 12(4), pages 547-578, November.
    Full references (including those not matched with items on IDEAS)

    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. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    2. Galli, Laura & Letchford, Adam N. & Miller, Sebastian J., 2018. "New valid inequalities and facets for the Simple Plant Location Problem," European Journal of Operational Research, Elsevier, vol. 269(3), pages 824-833.
    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. Fadda, Edoardo & Manerba, Daniele & Cabodi, Gianpiero & Camurati, Paolo Enrico & Tadei, Roberto, 2021. "Comparative analysis of models and performance indicators for optimal service facility location," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    5. 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.
    6. Khachatryan, Hayk & Jessup, Eric & Casavant, Kenneth, 2010. "A GIS-based Estimation of Regional Biomass Supply and Transportation Costs for Biofuel Plant Least-Cost Location Decisions," 51st Annual Transportation Research Forum, Arlington, Virginia, March 11-13, 2010 207816, Transportation Research Forum.
    7. Francisco Casas & Claudio E. Torres & Ignacio Araya, 2022. "A heuristic search based on diversity for solving combinatorial problems," Journal of Heuristics, Springer, vol. 28(3), pages 287-328, June.
    8. Peeters, Peter H., 1998. "Some new algorithms for location problems on networks," European Journal of Operational Research, Elsevier, vol. 104(2), pages 299-309, January.
    9. Mariano Gallo, 2019. "An Optimisation Model to Consider the NIMBY Syndrome within the Landfill Siting Problem," Sustainability, MDPI, vol. 11(14), pages 1-18, July.
    10. Oded Berman & Dmitry Krass & Mozart B. C. Menezes, 2007. "Facility Reliability Issues in Network p -Median Problems: Strategic Centralization and Co-Location Effects," Operations Research, INFORMS, vol. 55(2), pages 332-350, April.
    11. Mina Husseinzadeh Kashan & Ali Husseinzadeh Kashan & Nasim Nahavandi, 2013. "A novel differential evolution algorithm for binary optimization," Computational Optimization and Applications, Springer, vol. 55(2), pages 481-513, June.
    12. Kurt Jörnsten & Andreas Klose, 2016. "An improved Lagrangian relaxation and dual ascent approach to facility location problems," Computational Management Science, Springer, vol. 13(3), pages 317-348, July.
    13. Widener, Michael J. & Horner, Mark W., 2011. "A hierarchical approach to modeling hurricane disaster relief goods distribution," Journal of Transport Geography, Elsevier, vol. 19(4), pages 821-828.
    14. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    15. Kalczynski, Pawel & Drezner, Zvi, 2022. "The Obnoxious Facilities Planar p-Median Problem with Variable Sizes," Omega, Elsevier, vol. 111(C).
    16. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    17. 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.
    18. N Aras & M Orbay & I K Altinel, 2008. "Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 64-79, January.
    19. Bhuvnesh Sharma & M. Ramkumar & Nachiappan Subramanian & Bharat Malhotra, 2019. "Dynamic temporary blood facility location-allocation during and post-disaster periods," Annals of Operations Research, Springer, vol. 283(1), pages 705-736, December.
    20. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.

    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:180:y:2007:i:2:p:532-546. 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.