【作者】 李娜；

【导师】 汪浩祥；

【作者基本信息】 南京农业大学 ， 工程硕士（专业学位）， 2019， 硕士

【摘要】 覆盖问题是传统选址模型的一个经典问题,而最大覆盖选址模型又是覆盖型选址的一个主要分支。在针对最大覆盖选址问题的应用却越来越多,而传统的建模和数学规划方法不能很好地满足大规模的选址需求的问题,本文受到无线传感器网络节点部署方法的启发,将最大覆盖选址这一实际问题抽象后进行建模仿真,通过设置各种约束,提高了配送中心对服务区域的覆盖率。本文首先介绍了共同配送、最大覆盖选址问题和选址方法的研究现状,得出针对目前基于共同配送的最大覆盖选址问题方法的不足,设计了基于平衡距离的最大覆盖选址方案,将配送中心的移动分为几个过程,在每一个过程中配送中心根据平衡距离和位置信息进行下一步移动,使得聚集在一起的配送中心逐渐分散,实现对服务区域的最大覆盖,仿真结果证明了算法的有效性。针对基于平衡算法收敛过快和震荡的问题,设计了基于改进的虚拟力最大覆盖选址算法,配送中心根据其所受的虚拟力,向着感知概率低的区域进行移动,使得配送系统中的感知概率逐渐接近平均,从而实现对服务区域的最大覆盖,仿真结果证明了算法的有效性。以上的两种算法都是针对配送中心完全一样的情况,但现实生活中,配送中心的规模是要根据所服务的区域特点来进行确定的,基于平衡距离的配送系统不能进行异构的配送中心安置,所以本文基于改进的虚拟力选址算法,设计了异构的基于感知概率的配送中心选址模型,将配送中心分为两种,每一种配送中心根据其所受的虚拟力向着感知概率低的区域进行移动,使得配送系统中感知概率逐渐接近平均,实现对服务区域的最大覆盖,仿真结果证明了算法的有效性。在总结与展望部分,对比了三种算法覆盖率的变化,总结了三种算法的优缺点和适用情况;同时对算法中的不足和未来可能的发展方向进行了说明。更多还原

【Abstract】 The coverage problem is a classic problem of the facility location problem and the maximum coverage location model is a major branch of coverage location.In recent years,the research on the problem of maximum coverage location has been few innovations,but the application of the coverage problem is getting popular.Meanwhile,the methods of traditional modeling and mathematical programming are not capable of meeting the large-scale location requirements.Inspired by the wireless sensor network node deployment method,this paper considers the actual problem of maximum coverage location as an abstract problem.Modeling and simulating it by various constraints to improve the coverage rate of the distribution center system.This paper introduces the research status of collaborative distribution,maximum coverage location and location method at first.Draw the defects of the maximum coverage location problem based on collaborative distribution.This paper proposes a mobile solution which divides the mobile site selection process into multiple steps to improve service coverage.The movement of the distribution center is divided into several processes.With the balance distance between the distribution centers increasing,the distribution centers gradually "move" to more reasonable positions.In each process,the distribution center moves in the next step according to the balance distance and position information so that the coverage of the service area improved,and the simulation result proves the effectiveness of the algorithm.Because the balance distance algorithm converges too fast and oscillates,this paper designs an improved virtual force maximum coverage location algorithm.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 approaches the average,thus achieving the maximum coverage of the service area.The simulation result proves the effectiveness of the algorithm.The above two algorithms are exactly the same for the distribution center.In real life,the size of the distribution center is determined according to the characteristics of the service area.The distribution system based on the balance distance cannot perform the heterogeneous distribution center located.Therefore,this paper designs a heterogeneous perception-based distribution center location model based on the improved virtual force algorithm,which divides the distribution center into two types.Each distribution center moves to the area with low perceptual probability according to the virtual force it receives,so that the perceptual probability in the distribution system is gradually close to the average.The simulation results prove the effectiveness of the algorithm.The advantages,disadvantages and applications of the three algorithms are summarized in final section.Meanwhile,the immaturity in the algorithm and the possible future development directions are explained.更多还原