Journal of Artificial Intelligence Research · 2015 · 32 citations · 13 references
ManagementElectrical EngineeringTransportation PlanningTransportTransport PlanningTransportationMobility ManagementRoute PlanningShortest Path AlgorithmsTransportation ModelsTransportation ProblemsVehicle SchedulingBattery Electric VehiclesElectric Vehicle SchedulingEnergy Supply ConstraintsHeuristicsRoad Traffic NetworksShortest Path OptimizationShortest Path PlanningVehicle Routing
Compared to conventional cars, electric vehicles (EVs) still suffer from considerably shorter cruising ranges. Combined with the sparsity of battery loading stations, the complete transition to E-mobility still seems a long way to go. In this paper, we consider the problem of placing as few loading stations as possible so that on any shortest path there are sufficiently many not to run out of energy. We show how to model this problem and introduce heuristics which provide close-to-optimal solutions even in large road networks.
13
A Greedy Heuristic for the Set-Covering Problem
Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations
On the hardness of approximating vertex cover
Irit Dinur, Samuel Safra · Annals of Mathematics · 2005 · 635 citations · Full text
The Shuttle Radar Topography Mission
Douglas Alsdorf, Douglas W. Burbank, M. E. Oskin et al. · UNC Libraries · 2021 · 193 citations · Full text