A Strategic Routing Framework and Algorithms for Computing Alternative Paths

by   Thomas Bläsius, et al.

Traditional navigation services find the fastest route for a single driver. Though always using the fastest route seems desirable for every individual, selfish behavior can have undesirable effects such as higher energy consumption and avoidable congestion, even leading to higher overall and individual travel times. In contrast, strategic routing aims at optimizing the traffic for all agents regarding a global optimization goal. We introduce a framework to formalize real-world strategic routing scenarios as algorithmic problems and study one of them, which we call Single Alternative Path (SAP), in detail. There, we are given an original route between a single origin–destination pair. The goal is to suggest an alternative route to all agents that optimizes the overall travel time under the assumption that the agents distribute among both routes according to a psychological model, for which we introduce the concept of Pareto-conformity. We show that the SAP problem is NP-complete, even for such models. Nonetheless, assuming Pareto-conformity, we give multiple algorithms for different variants of SAP, using multi-criteria shortest path algorithms as subroutines. Moreover, we prove that several natural models are in fact Pareto-conform. The implementation of our algorithms serves as a proof of concept, showing that SAP can be solved in reasonable time even though the algorithms have exponential running time in the worst case.


page 1

page 2

page 3

page 4


Social Cost Guarantees in Smart Route Guidance

We model and study the problem of assigning traffic in an urban road net...

Traffic Optimization For a Mixture of Self-interested and Compliant Agents

This paper focuses on two commonly used path assignment policies for age...

Optimizing Group Utility in Itinerary Planning: A Strategic and Crowd-Aware Approach

Itinerary recommendation is a complex sequence prediction problem with n...

Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology

We investigate traffic routing both from the perspective of real world d...

A New Formulation of The Shortest Path Problem with On-Time Arrival Reliability

We study stochastic routing in the PAth-CEntric (PACE) uncertain road ne...

A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows

Instantaneous dynamic equilibrium (IDE) is a standard game-theoretic con...

Organisations (de-)centralised to a greater or lesser degree for allocating cities in two Multiple Travelling Salesmen Problems

Decisions in organisations may be made either by a Central Authority (CA...

Please sign up or login with your details

Forgot password? Click here to reset