Problems on One Way Road Networks

TL;DR

This paper studies the problem of collision-free traffic configuration in one way road networks, proving its NP-hardness and analyzing properties like connectedness and shortest paths.

Contribution

It introduces the collision-free traffic configuration problem in OWRNs, proves its NP-hardness, and explores properties such as connectedness and shortest paths.

Findings

Finding maximum collision-free car sets is NP-hard.

Properties of connectedness in OWRNs are characterized.

Shortest path analysis in OWRNs is conducted.

Abstract

Let $OWRN = \left\langle W_x,W_y \right\rangle$ be a One Way Road Network where $W_x$ and $W_y$ are the sets of directed horizontal and vertical roads respectively. $OWRN$ can be considered as a variation of directed grid graph. The intersections of the horizontal and vertical roads are the vertices of $OWRN$ and any two consecutive vertices on a road are connected by an edge. In this work, we analyze the problem of collision free traffic configuration in a $OWRN$. A traffic configuration is a two-tuple $TC=\left\langle OWRN, C\right\rangle$, where $C$ is a set of cars travelling on a pre-defined path. We prove that finding a maximum cardinality subset $C_{sub}\subseteq C$ such that $TC=\left\langle OWRN, C_{sub}\right\rangle$ is collision-free, is NP-hard. Lastly we investigate the properties of connectedness, shortest paths in a $OWRN$.