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 chro-mosome coding,and finally the effectiveness of the proposed algorithm is verified through a large number of ex-perimental simulations.
关键词
无人靶车/变邻域搜索算法/染色体/算法研究
Key words
Unmanned target vehicle/Variable neighborhood search algorithm/Chromosome/Algorithm research
维普
万方数据