MinMax Routing
Martin Ichilevici de Oliveira, Mário A. Nascimento · 2017
MinMax routing is the task of finding a feasible route between two points such that the maximum distance between any point in the path and a set of points-of-interest is minimal. In this demonstration paper we focus on the case of routing electric vehicles and where points-of-interest are charging stations. In this scenario, the MinMax route guarantees that for any arbitrary point in such a route, the maximum distance that has to be traveled in order to reach a charging station is minimal, being thus a "safer" route. We propose a solution to the MinMax routing problem and implement a web-based prototype that produces practical MinMax routes in realistic sized networks, e.g., the state of California, in sub-second processing time.