摘要
针对单个移动充电器自身耗能最短路径规划问题,采用基于改良圈修正初解的遗传算法进行求解,同时利用LKH算法进行检验得到一致的结果,最终得出的路径最小值为11483.24m.在此基础上,对于最小电池容量的问题,创新性地提出了条件大规模传感器电池容量和中小型传感器电池下的时变模型,并给出其中下满足不同周期的最小电池容量方案.
Aiming at the shortest path planning problem of a single mobile charger's own energy consumption,the Genetic algorithm based on the modified initial solution of the modified circle is used to solve the problem,and the LKH algorithm is used to verify the consistence.For the problem of minimum battery capacity,the conditional large-scale sensor battery capacity and the time-varying model of small and medium-sized sensor batteries are proposed,and the minimum battery capacity schemes satisfying different cycles are given.
作者
张胜利
张浩浩
赵伟
夏欣
ZHANG Shengli;ZHANG Haohao;ZHAO Wei;XIA Xin(School of Mathematical and Statistics, Xidian University, Xi'an 710126, PRC)
出处
《高等数学研究》
2022年第2期68-72,共5页
Studies in College Mathematics
基金
陕西省自然科学基础研究计划项目(2021JM-115).
关键词
遗传算法
LKH算法
时变模型
Genetic algorithm
LKH algorithm
time-varying model
