Optimizing Tours for Mobile Chargers with Roadside Segment Coverage: Poster Abstract

In this poster, we investigate the problem of scheduling mobile chargers in roadside wireless rechargeable sensor network. Taking mobility constraints caused by city topological graph into consideration, we aim at optimizing the traveling path for chargers to minimize the traveling cost. Therefore, the scheduling problem is converted into edge coverage problem, which is substantially different from the previous point coverage problems. We formulate aforementioned problem into CARP (Capacitated Arc Routing Problem), which has been proved to be NP-hard. Then we use the genetic algorithm cooperated with a decoding scheme to solve it. Finally, we evaluate the impacts of different parameters on our algorithm and get the near optimal solution.