Research And Design Of Route Planning System Based On Equipment Distribution

With the development of artificial intelligence in the field of combat logistics,the traditional equipment security model has been difficult to adapt to the security requirements under high technology combat conditions,and combat logistics has put forward higher requirements for the vehicle path distribution of equipment.As the equipment distribution path will be affected by different factors in different combat states,and combat logistics distribution tasks are often urgent,strengthening the study of combat logistics distribution is conducive to improving the ability to quickly secure combat materials,therefore,the study of issues related to combat logistics distribution has important theoretical value and practical significance.In-depth research has been conducted on the characteristics of equipment distribution under two states of combat readiness and wartime.The main research contents are as follows.(1)An improved hunger game search algorithm(IHGS＿CD)combined with a cluster decomposition strategy is proposed for the problem of equipment distribution with a time window in a combat readiness state.First,a K-means-based balanced constrained clustering algorithm(BCGS)is used to decompose the multi-supplier vehicle path problem with time windows into a single-supplier vehicle path problem with time windows,and then,an improved hunger game search algorithm(IHGS)is proposed to solve the problem,using accuracy constraint parameters to improve the individual accuracy of the algorithm.(2)To address the problem that in the wartime state distribution process,the distribution path or demand place may encounter enemy strikes in the danger zone,making it difficult for the distribution vehicles to successfully complete the distribution task,a distribution avoidance scheme based on the range of the danger zone in wartime is proposed.Firstly,a segmented path planning algorithm(BWO＿D*)combining Black Widow Optimization(BWO)algorithm and D* algorithm is proposed to carry out danger zone crossing avoidance to deal with the situation when the demand place is within the danger zone,and the distribution path is decomposed into as soon as possible distribution phase and safe distribution phase according to the danger zone range to achieve a fast and reduced danger strike distribution process.Secondly,the D*algorithm is used for danger zone bypass avoidance to deal with the situation when the danger zone is encountered in the distribution path,but the demand place is not within the danger zone envelope.Finally,the feasibility of the proposed avoidance scheme is verified by simulation experiments.(3)A path planning system based on equipment distribution is studied and designed.According to the user requirements and the scope of the wartime danger zone,the architecture analysis and the design of functional modules were conducted for the functions of multi-supplier division,wartime path planning,wartime danger zone avoidance and distribution feedback,and the improved Hunger Games search algorithm combining the cluster decomposition strategy and the segmented path planning algorithm combining the Black Widow optimization algorithm and the D* algorithm were applied to the system.The feasibility of this path planning system is verified by testing.