Skip to main content

Research on Logistics Center Location-Allocation Problem Based on Two-Stage K-Means Algorithms

  • Conference paper
  • First Online:
Advances in Computer Science for Engineering and Education III (ICCSEEA 2020)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1247))

Abstract

Economy and timeliness are two key issues to be considered in the location of logistics center. This paper makes a logistics center location-allocation model with economy (i.e. total transportation turnover level) as the decision goal, and timeliness (i.e. the maximum transportation distance tolerated) as the constraint condition. Then a two-stage algorithm based on K-means clustering is proposed to solve the model. Firstly, it uses K-means algorithm to calculate the initial location and service area division of logistics center from the perspective of economy. Secondly, in each service area, location scheme is optimized and adjusted to with the lowest total transportation turnover. The example shows that the algorithm can effectively solve the location-allocation problem of logistics center with time constraint.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Similar content being viewed by others

References

  1. Lara, C.L., Trespalacios, F., Grossmann, I.E.: Global optimization algorithm for capacitated multi-facility continuous location-allocation problems. J. Global Optim. 71(4), 871–889 (2018)

    Article  MathSciNet  Google Scholar 

  2. Mirzaei, E., Bashiri, M., Shemirani, H.S.: Exact algorithms for solving a bi-level location–allocation problem considering customer preferences. J. Ind. Eng. Int. 15(3), 423–433 (2019)

    Article  Google Scholar 

  3. Allahbakhsh, M., Arbabi, S., Galavii, M., et al.: Crowdsourcing planar facility location allocation problems. Computing 101(3), 237–261 (2019)

    Article  MathSciNet  Google Scholar 

  4. Abareshi, M., Zaferanieh, M.: A bi-level capacitated P-median facility location problem with the most likely allocation solution. Transp. Res. Part B: Methodol. 123, 1–20 (2019)

    Article  Google Scholar 

  5. Rizeei, H.M., Pradhan, B., Saharkhiz, M.A.: Allocation of emergency response centres in response to pluvial flooding-prone demand points using integrated multiple layer perceptron and maximum coverage location problem models. Int. J. Disaster Risk Reduct. 8(3) (2019)

    Google Scholar 

  6. Dong, K.-F., Gan, H.-C., Zhang, H.-Z.: Distribution center location model based on economics and timeliness. J. Univ. Shanghai Sci. Technol. 35(04), 336–339+344 (2013). (in Chinese)

    Google Scholar 

  7. Xie, T., Zhou, Q., Shi, U.-F.: Nodes location of the shaft radial logistics network of agricultural products based on the analysis of time reliability. J. Changsha Univ. Sci. Technol. (Nat. Sci.) 12(02), 15–20 (2015). (in Chinese)

    Google Scholar 

  8. Feng, J., Gai, W.: Research on multi-objective optimization model and algorithm for reserve site selection of emergency materials. J. Saf. Sci. Technol. 14(06), 64–69 (2018)

    Google Scholar 

  9. Tian, S., Yang, Y., Tian, Y., et al.: On the optimized construction site choice for the oil spilling emergency point in the middle and lower reaches of Yangtze river. J. Saf. Environ. 17(1), 90–93 (2017). (in Chinese)

    Google Scholar 

  10. Rawat, B., Dwivedi, S.K.: Analyzing the performance of various clustering algorithms. Int. J. Mod. Educ. Comput. Sci. (IJMECS) 11(1), 45–53 (2019)

    Article  Google Scholar 

  11. Mahmood, S., Rahaman, M.S., Nandi, D., Rahman, M.: A proposed modification of K-means algorithm. Int. J. Mod. Educ. Comput. Sci. (IJMECS) 7(6), 37–42 (2015)

    Article  Google Scholar 

  12. Babatunde, G., Emmanuel, A.A., Oluwaseun, O.R., Bunmi, O.B., Precious, A.E.: Impact of climatic change on agricultural product yield using K-means and multiple linear regressions. Int. J. Educ. Manag. Eng. (IJEME) 9(3), 16–26 (2019)

    Article  Google Scholar 

  13. Kumar, E.S., Talasila, V., Rishe, N., Kumar, T.V.S., Iyengar, S.S.: Location identification for real estate investment using data analytics. Int. J. Data Sci. Anal. 8(3), 299–323 (2019)

    Article  Google Scholar 

  14. Wang, Y.: Optimization on fire station location selection for fire emergency vehicles using K-means algorithm. In: Proceedings of the 2018 3rd International Conference on Advances in Materials, Mechatronics and Civil Engineering (ICAMMCE 2018), pp. 332–342 (2018)

    Google Scholar 

  15. Zamar, D.S., Gopaluni, B., Sokhansanj, S.: A constrained K-means and nearest neighbor approach for route optimization in the Bale collection problem. IFAC-PapersOnLine 50(1), 12125–12130 (2017)

    Article  Google Scholar 

  16. Lu, L.-L., Qin, J.-T.: Multi-regional logistics distribution center location method based on improved K-means algorithm. Comput. Syst. Appl. 28(08), 251–255 (2019). (in Chinese)

    Google Scholar 

  17. Yu, X.-H., Wang, D.: Study on city express delivery area division based on constrained K-means clustering algorithm. J. Harbin Univ. Commer. (Nat. Sci. Ed.) 32(5), 631–634 (2016). (in Chinese)

    Google Scholar 

  18. Li, J.-C., Tao, Y.-D., Sun, Y., Gao, C.: Location algorithm of logistics distribution facilities based on BIRCH clustering. Comput. Syst. Appl. 27(9), 215–219 (2018). (in Chinese)

    Google Scholar 

Download references

Acknowledgment

This project is supported by: Doctoral research fund subsidized project of WTBU (D2018007); Natural Science Foundation of Hubei Province(2019CFC930); Distinguished Young and Middle-aged Team Program for Scientific and Technological Innovation in Higher Education of Hubei (T201938).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Meng Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, M., Wei, X. (2021). Research on Logistics Center Location-Allocation Problem Based on Two-Stage K-Means Algorithms. In: Hu, Z., Petoukhov, S., Dychka, I., He, M. (eds) Advances in Computer Science for Engineering and Education III. ICCSEEA 2020. Advances in Intelligent Systems and Computing, vol 1247. Springer, Cham. https://doi.org/10.1007/978-3-030-55506-1_5

Download citation

Publish with us

Policies and ethics