Computer Engineering and Applications ›› 2020, Vol. 56 ›› Issue (20): 220-225.DOI: 10.3778/j.issn.1002-8331.1907-0415

Previous Articles     Next Articles

Research on Improved Virtual Force Maximum Coverage Location Algorithm

WANG Haoxiang, LI Na, LI Qiangyi   

  1. 1.College of Engineering, Nanjing Agricultural University, Nanjing 210031, China
    2.College of Computer and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
  • Online:2020-10-15 Published:2020-10-13

改进的虚拟力最大覆盖选址算法研究

汪浩祥,李娜,李强懿   

  1. 1.南京农业大学 工学院,南京 210031
    2.南京航空航天大学 计算机与科技学院,南京 211106

Abstract:

This paper studies the location problem of distribution center under common distribution, and proposes a location algorithm based on improved virtual force with the coverage rate as the optimization object. According to the virtual force it receives, the distribution center moves to the region with low perception probability, making the perception in the distribution system gradually approach the average, thus achieving the maximum coverage of the service area. Finally, the Matlab simulation of the algorithm shows an average coverage increase of 22.58%, which proves the effectiveness of the algorithm.

Key words: facility location, maximal covering problem, virtual force, Matlab

摘要:

针对基于共同配送背景下配送中心的选址问题,以覆盖率为优化目标,设计了基于改进的虚拟力最大覆盖选址算法,配送中心根据其所受的虚拟力,向着感知概率低的区域进行移动,使得配送系统中的感知概率逐渐接近平均,从而实现对服务区域的最大覆盖;通过Matlab仿真,基于改进的虚拟力算法使得覆盖率平均提升了22.58%,证明了该算法的有效性。

关键词: 选址, 最大覆盖问题, 虚拟力, Matlab