IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v136y2005i1p99-11510.1007-s10479-005-2041-5.html
   My bibliography  Save this article

A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost

Author

Listed:
  • J. Brimberg
  • S. Salhi

Abstract

A zone-dependent fixed cost is introduced within the framework of minisum location of facilities in the continuous space. An efficient algorithm for determining the optimal solution for the single facility location problem is put forward, and its properties are validated. A hypothetical example is given to illustrate the algorithm. Some heuristic procedures are proposed for the multi-facility case with encouraging results. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • J. Brimberg & S. Salhi, 2005. "A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost," Annals of Operations Research, Springer, vol. 136(1), pages 99-115, April.
    • Handle: RePEc:spr:annopr:v:136:y:2005:i:1:p:99-115:10.1007/s10479-005-2041-5
    DOI: 10.1007/s10479-005-2041-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-005-2041-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-005-2041-5?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. P. Hansen & D. Peeters & J.-F. Thisse, 1982. "An Algorithm for a Constrained Weber Problem," Management Science, INFORMS, vol. 28(11), pages 1285-1295, November.
    2. Jack Brimberg & Robert F. Love, 1993. "Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances," Operations Research, INFORMS, vol. 41(6), pages 1153-1163, December.
    3. 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.
    4. Y. P. Aneja & M. Parlar, 1994. "Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel," Transportation Science, INFORMS, vol. 28(1), pages 70-76, February.
    5. Margaret L. Brandeau & Samuel S. Chiu, 1989. "An Overview of Representative Problems in Location Research," Management Science, INFORMS, vol. 35(6), pages 645-674, June.
    6. M D H Gamal & S Salhi, 2001. "Constructive heuristics for the uncapacitated continuous location-allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(7), pages 821-829, July.
    7. Butt, Steven E. & Cavalier, Tom M., 1996. "An efficient algorithm for facility location in the presence of forbidden regions," European Journal of Operational Research, Elsevier, vol. 90(1), pages 56-70, April.
    8. Horst Hamacher & Kathrin Klamroth, 2000. "Planar Weber location problems with barriers and block norms," Annals of Operations Research, Springer, vol. 96(1), pages 191-208, November.
    9. Klamroth, K., 2001. "A reduction result for location problems with polyhedral barriers," European Journal of Operational Research, Elsevier, vol. 130(3), pages 486-497, May.
    10. Beasley, J. E., 1993. "Lagrangean heuristics for location problems," European Journal of Operational Research, Elsevier, vol. 65(3), pages 383-399, March.
    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. Saïd Salhi & Gábor Nagy, 2009. "Local improvement in planar facility location using vehicle routing," Annals of Operations Research, Springer, vol. 167(1), pages 287-296, March.
    2. Dimitris Fotakis & Epameinondas Sidiropoulos, 2014. "Combined land-use and water allocation planning," Annals of Operations Research, Springer, vol. 219(1), pages 169-185, August.
    3. John Carlsson & Mehdi Behroozi & Xiang Li, 2016. "Geometric partitioning and robust ad-hoc network design," Annals of Operations Research, Springer, vol. 238(1), pages 41-68, March.
    4. Faiz, Tasnim Ibn & Noor-E-Alam, Md, 2019. "Data center supply chain configuration design: A two-stage decision approach," Socio-Economic Planning Sciences, Elsevier, vol. 66(C), pages 119-135.
    5. Chandra Ade Irawan & Martino Luis & Said Salhi & Arif Imran, 2019. "The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 275(2), pages 367-392, April.
    6. Chandra Ade Irawan & Said Salhi & Kusmaningrum Soemadi, 2020. "The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods," Journal of Global Optimization, Springer, vol. 78(2), pages 271-294, October.
    7. Liu, Yanchao, 2023. "An elliptical cover problem in drone delivery network design and its solution algorithms," European Journal of Operational Research, Elsevier, vol. 304(3), pages 912-925.
    8. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.
    9. Haase, Knut & Hoppe, Mirko, 2008. "Standortplanung unter Wettbewerb - Teil 1: Grundlagen," Discussion Papers 2/2008, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    10. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.
    11. John Gunnar Carlsson & Mehdi Behroozi & Xiang Li, 2016. "Geometric partitioning and robust ad-hoc network design," Annals of Operations Research, Springer, vol. 238(1), pages 41-68, March.

    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. Masashi Miyagawa, 2017. "Continuous location model of a rectangular barrier facility," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 95-110, April.
    2. Malgorzata Miklas-Kalczynska & Pawel Kalczynski, 2024. "Multiple obnoxious facility location: the case of protected areas," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
    3. P.M. Dearing & H.W. Hamacher & K. Klamroth, 2002. "Dominating sets for rectilinear center location problems with polyhedral barriers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(7), pages 647-665, October.
    4. Masashi Miyagawa, 2012. "Rectilinear distance to a facility in the presence of a square barrier," Annals of Operations Research, Springer, vol. 196(1), pages 443-458, July.
    5. Murat Oğuz & Tolga Bektaş & Julia A Bennell & Jörg Fliege, 2016. "A modelling framework for solving restricted planar location problems using phi-objects," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(8), pages 1080-1096, August.
    6. Amiri-Aref, Mehdi & Farahani, Reza Zanjirani & Hewitt, Mike & Klibi, Walid, 2019. "Equitable location of facilities in a region with probabilistic barriers to travel," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 66-85.
    7. Oğuz, Murat & Bektaş, Tolga & Bennell, Julia A., 2018. "Multicommodity flows and Benders decomposition for restricted continuous location problems," European Journal of Operational Research, Elsevier, vol. 266(3), pages 851-863.
    8. Canbolat, Mustafa S. & Wesolowsky, George O., 2010. "The rectilinear distance Weber problem in the presence of a probabilistic line barrier," European Journal of Operational Research, Elsevier, vol. 202(1), pages 114-121, April.
    9. P. Dearing & K. Klamroth & R. Segars, 2005. "Planar Location Problems with Block Distance and Barriers," Annals of Operations Research, Springer, vol. 136(1), pages 117-143, April.
    10. Pawel Kalczynski & Zvi Drezner, 2021. "The obnoxious facilities planar p-median problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 577-593, June.
    11. J Brimberg & N Mladenovic & S Salhi, 2004. "The multi-source Weber problem with constant opening cost," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 640-646, June.
    12. 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.
    13. Canbolat, Mustafa S. & Wesolowsky, George O., 2012. "On the use of the Varignon frame for single facility Weber problems in the presence of convex barriers," European Journal of Operational Research, Elsevier, vol. 217(2), pages 241-247.
    14. Wang, Shaojun & Sarker, Bhaba R. & Mann, Lawrence & Triantaphyllou, Evangelos, 2004. "Resource planning and a depot location model for electric power restoration," European Journal of Operational Research, Elsevier, vol. 155(1), pages 22-43, May.
    15. Klamroth, K., 2004. "Algebraic properties of location problems with one circular barrier," European Journal of Operational Research, Elsevier, vol. 154(1), pages 20-35, April.
    16. 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.
    17. Kathrin Klamroth & Margaret M. Wiecek, 2002. "A Bi-Objective Median Location Problem With a Line Barrier," Operations Research, INFORMS, vol. 50(4), pages 670-679, August.
    18. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 2000. "An exact method for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 123(3), pages 473-489, June.
    19. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.
    20. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 1997. "Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 102(3), pages 611-625, 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:136:y:2005:i:1:p:99-115:10.1007/s10479-005-2041-5. 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.