No abstract

No abstract

Eco-routing is a vehicle navigation method that aims to minimize fuel or energy consumption for a given trip. It is based on a hypothesis that we can trade extra travel time for lower consumption. While the hypothesis was experimentally verified the design of a method that would fully exploit its potential proves challenging. Current solutions hinge on assumption that energy spent on any given road does not change in time. We challenge validity of this assumption by studying performance of such methods in detailed second-bysecond simulation that pronounces the time-dependencies. This allows us to quantify the real savings attainable with current eco-routing. I. INTRODUCTION Eco-routing 1 emerged as one of the strategies that aim to lower vehicle operating costs [12], [6], [4], [2]. The idea is to minimize energy (or fuel) consumption by route selection: given some origin and destination, eco-routing plots a route such that energy (fuel) needed to finish the trip is minimal. The routing is usually done on a graph where nodes represent junctions, edges represent roads and costs are estimated energies needed to travel between two junctions the road connects. Minimal path routing 2 can then be used to find the route that minimizes total energy for the trip. Authors typically reduce the complex time-variant functions that describe the costs. They must be time-invariant and nonnegative in order to use Dijkstra's routing algorithm, which is a common choice between authors. Validation is often done using the same assumptions. Full experimental validation would require a host of identical vehicles to depart from spatially and temporally identical place in order to measure consumptions on different paths to destination reliably.