Skip to main content
SpringerLink
Log in

Algorithm for the Facility Location Problem with Origin and Destination

  • Conference paper
  • First Online:
Parallel and Distributed Computing, Applications and Technologies (PDCAT 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13148))

  • 1440 Accesses

Abstract

The Uncapacitated Facility Location Problem with Origin and Destination (FLPWOD) is an extension of the Uncapacitated Facility Location Problem (UFLP), where each unit of demand has its own origin and destination, and must be shipped from its origin via a location at which a transit station is built, to its destination. As in the UFLP, facilities can be opened at any of the predefined locations with given fixed costs. In classical location models, the clients have to be assigned to the open facilities, and the assignment cost is the distance between a client and an open facility. In the FLPWOD, the demands with origins and destinations have to be assigned to the open facilities, and the assignment cost is the length of a tour form the origin to the destination through an open facility. LP-rounding approximation algorithm is developed with the first constant approximation ratio 4.

Supported by NNSF of China under Grant No. 11901544.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. An, H.C., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. In: Proceedings of IEEE, Symposium on Foundations of Computer Science. IEEE Computer Society, pp. 256–265 (2014)

    Google Scholar 

  2. Comuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory. Wiley, New York, pp. 119–171 (1990)

    Google Scholar 

  3. Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33, 1–25 (2003)

    Article  MathSciNet  Google Scholar 

  4. Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228–248 (1999)

    Article  MathSciNet  Google Scholar 

  5. Hh, A., Zo, B.: An improved scatter search algorithm for the uncapacitated facility location problem. Comput. Ind. Eng. 135, 855–867 (2019)

    Article  Google Scholar 

  6. Klincewicz, J.G.: Enumeration and search procedures for a Hub location problem with economies of scale. Ann. Oper. Res. 110, 107–122 (2002)

    Article  MathSciNet  Google Scholar 

  7. Li, S.: A 1.488 Approximation algorithm for the uncapacitated facility location problem. In: Proceedings of the ICALP, Part II, pp. 77–88 (2011)

    Google Scholar 

  8. Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear/submodular penalties. Algorithmica 73(2), 460–482 (2015)

    Article  MathSciNet  Google Scholar 

  9. Labbe, M., Louveaux, F.V.: Location problems. In: DelPAmico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization. Wiley, Chiehester, UK, pp. 261–281 (1997)

    Google Scholar 

  10. Lv, W., Wu, C.: An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties. J. Comb. Optim. 41(4), 888–904 (2021). https://doi.org/10.1007/s10878-021-00726-0

    Article  MathSciNet  MATH  Google Scholar 

  11. Nezhad, N.A.T., Moradi, S., Karamali, G.: Fuzzy facility location problem with point and rectangular destinations. Int. J. Math. Oper. Res. 18(1), 21–44 (2021)

    Article  MathSciNet  Google Scholar 

  12. Quilliot, A., Sarbinowski, A.: Facility location models for vehicle sharing systems. In: Computer Science Information Systems. IEEE (2016)

    Google Scholar 

  13. Shmoys, D.B., Tardös, É., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 265–274 (1997)

    Google Scholar 

  14. Wang, F., Hu, X., Wu, C.: 2-level station location for bike sharing. In: Zhang, Z., Li, W., Du, D.Z. (eds.) Algorithmic Aspects in Information and Management. AAIM 2020 (2020)

    Google Scholar 

  15. Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalty. Inf. Process. Lett. 94, 119–123 (2005)

    Article  Google Scholar 

  16. Zhang, J., Pan, X., Li, M., Yu, P.S.: Bicycle-sharing systems expansion: station re-deployment through crowd planning. In: ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems ACM, vol. 2 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beijing Jinghang Research Institute of Computing and Communication, Beijing, 100074, People’s Republic of China

    Fengmin Wang, Chu Wang, Na Li & Wenxing Kang

Authors
  1. Fengmin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Na Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wenxing Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sun Yat-sen University, Guangzhou, Guangdong, China

    Hong Shen

  2. Sun Yat-sen University, Guangzhou, China

    Yingpeng Sang

  3. Shenzhen Institute of Advanced Technology, Shenzhen, China

    Yong Zhang

  4. Sun Yat-sen University, Guangzhou, China

    Nong Xiao

  5. University of Georgia, Athens, GA, USA

    Hamid R. Arabnia

  6. University of Utah, Salt Lake City, USA

    Geoffrey Fox

  7. Western Michigan University, Kalamazoo, MI, USA

    Ajay Gupta

  8. Stevens Institute of Technology, Hoboken, NJ, USA

    Manu Malek

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, F., Wang, C., Li, N., Kang, W. (2022). Algorithm for the Facility Location Problem with Origin and Destination. In: Shen, H., et al. Parallel and Distributed Computing, Applications and Technologies. PDCAT 2021. Lecture Notes in Computer Science(), vol 13148. Springer, Cham. https://doi.org/10.1007/978-3-030-96772-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-96772-7_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-96771-0

  • Online ISBN: 978-3-030-96772-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation