无人靶车路径规划及其算法研究

Research on Path Planning for Unmanned Target Vehicles and Its Algorithm

靶车路径问题(Target Vehicle Routing Problem,TVRP)是组合优化领域的热点问题。首次提出了无人靶车路径问题(Unmanned Target Vehicle Routing Problem,UTVRP),建立了以最小化运输成本为优化目标的整数规划模型;其次提出一种带成本最优法的变邻域搜索算法(Variable Neighborhood Search with Cost Optimal Method,VNSCOM)。算法的初始阶段对目标问题进行单基因染色体编码操作。首先,提出成本最优法对问题的初始解进行构造,其次在单基因染色体编码下进行邻域变化,最后通过大量实验仿真,验证了提出算法的有效性。

The target vehicle routing problem(TVRP)is a hot problem in the field of combinatorial optimization.The unmanned target vehicle routing problem(UTVRP)is proposed for the first time,an integer planning model with the optimization objective of minimizing transportation costs is established,and then a variable neighborhood search with cost ptimal method(VNSCOM)is proposed.In the initial stage of the algorithm,the single-gene chromosome coding operation is performed on the target problem.The cost optimal method is first proposed to construct the initial solution of the problem,then the neighborhood change is performed under single-gene chromosome coding,and finally the effectiveness of the proposed algorithm is verified through a large number of experimental simulations.