IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v35y2018i2d10.1007_s10878-017-0179-0.html
   My bibliography  Save this article

A local search approximation algorithm for the uniform capacitated k-facility location problem

Author

Listed:
  • Lu Han

    (Beijing University of Technology)

  • Dachuan Xu

    (Beijing University of Technology)

  • Donglei Du

    (University of New Brunswick)

  • Dongmei Zhang

    (Shandong Jianzhu University)

Abstract

In the uniform capacitated k-facility location problem (UC-k-FLP), we are given a set of facilities and a set of clients. Every client has a demand. Every facility have an opening cost and an uniform capacity. For each client–facility pair, there is an unit service cost to serve the client with unit demand by the facility. The total demands served by a facility cannot exceed the uniform capacity. We want to open at most k facilities to serve all the demands of the clients without violating the capacity constraint such that the total opening and serving cost is minimized. The main contribution of this work is to present the first combinatorial bi-criteria approximation algorithm for the UC-k-FLP by violating the cardinality constraint.

Suggested Citation

  • Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2018. "A local search approximation algorithm for the uniform capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 409-423, February.
    • Handle: RePEc:spr:jcomop:v:35:y:2018:i:2:d:10.1007_s10878-017-0179-0
    DOI: 10.1007/s10878-017-0179-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0179-0
    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/s10878-017-0179-0?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. Jiawei Zhang & Bo Chen & Yinyu Ye, 2005. "A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 389-403, May.
    2. Alan S. Manne, 1964. "Plant Location Under Economies-of-Scale--Decentralization and Computation," Management Science, INFORMS, vol. 11(2), pages 213-235, November.
    3. Chung-Piaw Teo & Jia Shu, 2004. "Warehouse-Retailer Network Design Problem," Operations Research, INFORMS, vol. 52(3), pages 396-408, June.
    4. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Alfred A. Kuehn & Michael J. Hamburger, 1963. "A Heuristic Program for Locating Warehouses," Management Science, INFORMS, vol. 9(4), pages 643-666, July.
    7. Jia Shu & Chung-Piaw Teo & Zuo-Jun Max Shen, 2005. "Stochastic Transportation-Inventory Network Design Problem," Operations Research, INFORMS, vol. 53(1), pages 48-60, February.
    8. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    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. Min Li, 2022. "The bi-criteria seeding algorithms for two variants of k-means problem," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1693-1704, October.
    2. Chenchen Wu & Donglei Du & Yue Kang, 0. "An approximation algorithm for stochastic multi-level facility location problem with soft capacities," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    3. Chenchen Wu & Donglei Du & Yue Kang, 2022. "An approximation algorithm for stochastic multi-level facility location problem with soft capacities," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1680-1692, October.

    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. Lu Han & Dachuan Xu & Yicheng Xu & Dongmei Zhang, 2020. "Approximating the $$\tau $$ τ -relaxed soft capacitated facility location problem," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 848-860, October.
    2. Jia Shu, 2010. "An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization," Transportation Science, INFORMS, vol. 44(2), pages 183-192, May.
    3. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    4. Wenjun Ni & Jia Shu & Miao Song & Dachuan Xu & Kaike Zhang, 2021. "A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 86-104, January.
    5. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2017. "Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 767-779, November.
    6. Yanjun Jiang & Dachuan Xu & Donglei Du & Chenchen Wu & Dongmei Zhang, 2018. "An approximation algorithm for soft capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 493-511, February.
    7. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    8. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    9. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    10. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    11. Puntipa Punyim & Ampol Karoonsoontawong & Avinash Unnikrishnan & Chi Xie, 2018. "Tabu Search Heuristic for Joint Location-Inventory Problem with Stochastic Inventory Capacity and Practicality Constraints," Networks and Spatial Economics, Springer, vol. 18(1), pages 51-84, March.
    12. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    13. Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
    14. Hussein Naseraldin & Yale T. Herer, 2008. "Integrating the Number and Location of Retail Outlets on a Line with Replenishment Decisions," Management Science, INFORMS, vol. 54(9), pages 1666-1683, September.
    15. repec:dgr:rugsom:99a17 is not listed on IDEAS
    16. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
    17. Bisera Andria Gusavac & Dragana Stojanovic & Zeljko Sokolovic, 2014. "Application Of Some Locational Models in Natural Resources Industry – Agriculture Case," Romanian Statistical Review Supplement, Romanian Statistical Review, vol. 62(8), pages 82-93, August.
    18. Eric DuBois & Ashley Peper & Laura A. Albert, 2023. "Interdicting Attack Plans with Boundedly Rational Players and Multiple Attackers: An Adversarial Risk Analysis Approach," Decision Analysis, INFORMS, vol. 20(3), pages 202-219, September.
    19. Zhang, Zhi-Hai & Unnikrishnan, Avinash, 2016. "A coordinated location-inventory problem in closed-loop supply chain," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 127-148.
    20. Zhenning Zhang & Bin Liu & Yishui Wang & Dachuan Xu & Dongmei Zhang, 2022. "Maximizing a monotone non-submodular function under a knapsack constraint," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1125-1148, July.
    21. J Brimberg & P Hansen & G Laporte & N Mladenović & D Urošević, 2008. "The maximum return-on-investment plant location problem with market share," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 399-406, March.

    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:jcomop:v:35:y:2018:i:2:d:10.1007_s10878-017-0179-0. 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.