Research On Mobile Communication Base Station Operation And Maintenance Of Vehicle Routing Problem

With the spread and application of 5G networks in reality,the quality of people's life will be further improved.The smoothly promotion of 5G network is inseparable from the basic construction and maintenance of the base station network.The company for the construction and maintenance of the national mobile communication infrastructure network is China Tower Corp Ltd.At present,the company relies on staff's experience basically,resulting in an annual Operation and maintenance costs of ten billion RMB.Based on the situation,the article studies a type of pickup and delivery vehicle routing problem that the company needs to address urgently.For the company's daily base station maintenance problem,the problem belongs to the dynamic multi-vehicle selective and repeatable pick-up and delivery problem with time windows(DMVSRPDPTW),a dynamic vehicle routing model based on dynamic requirements is established.For the real-time arrival requirements,the dynamic problem is divided into several static problems;Each time a static problem is solved,the initial solution is constructed by the insertion algorithm,and the improved variable neighborhood search algorithm is designed to improve the initial solution.In order to accurately calculate the time when the vehicle arrives at each request,the traffic time of any two points is read from the Baidu map.Multiple instances are constructed based on the historical data from the China Tower Corp Ltd illustrate: the proposed algorithm could get better results in one minute,and it has an average improvement of 46.47% compared with the existing experience of the company,and an average improvement of 30.38% compared with the insertion algorithm.The algorithm has been applied by the company in actual base station operation and maintenance to reduce the maintenance costs efficiently.For the problem of large-scale maintenance of base station,this problem belongs to the problem of selective and repeatable pick-up and delivery vehicle route problem with variable time windows.For each demand,the service type and the time window change after some vehicle visits.We estimate the maximum number of visits to characterize multiple visits for each base station,and build a linear programming model.We design an insertion algorithm according to the changes of time windows of base station.To improve the quality of the solution,we design a solution framework based on variable neighborhood search.We construct multiple instances based on the historical data of the company,and the results obtained by this algorithm are 27.13% better than those obtained by the insertion algorithm.The efficiency of the proposed algorithm is proved,and the algorithm can be applied to large-scale operation and maintenance of company base stations.Finally,this paper analyzes the sensitivity of the company's various resources and the weighs of objective,and provides suggestions for the company in parameter setting and resource configuration.The problems studied in this paper not only improve the efficiency of the company's operation and maintenance,reduce its offline costs,promote the popularity of 5G networks,and provide users with better mobile Internet service,but also propose new variants of pickup and delivery problems.And the research in this paper has a certain reference significance for solving this type of problem.