一种交通道路限制下的充电车辆调度方案

A Charging Vehicle Scheduling Scheme with Traffic Road Restrictions

充电调度是无线可充电传感器网络中的关键科学问题之一。现有研究主要集中在如何调度充电车辆以获得最优的移动路径。但是,当道路受到限制时,这些算法无法提供良好的性能。本文考虑具有交通道路约束的移动充电车辆调度问题,提出一种移动受限的按需充电调度方案(mobility constrained charging scheduling scheme,MCCS)。为了更好地适用于实际场景,本文将该问题形式化为边缘覆盖问题。通过添加路径分解算子和变异算子来优化经典的扩展邻域搜索模因算法(memetic algorithm with extended neighborhood search,MAENS)。最后本文仿真评估了MCCS的性能,并与MAENS进行了比较。实验结果表明,MCCS平均移动能耗低且算法鲁棒性强,性能表现出色。

Charging scheduling is a very important item for wireless rechargeable sensor networks.Existing researches mainly focus on scheduling charging vehicles to obtain the optimal mobile path.However,these algorithms cannot provide good performance when traffic is restricted.Considering the mobile charging vehicle scheduling problem with traffic road constraints,this paper proposes a mobility constrained charging scheduling scheme(MCCS).To better fit the actual scene,we formalize the problem as an edge coverage problem,and enhance the classical MAENS algorithm by adding a path decomposition operator and a mutation operator.The performance of MCCS is evaluated by extensive simulations.Compared with MAENS,experimental results show that MCCS achieves su-perior performance in terms of low average energy consumption and high charging stability.