Optimising Dynamic Traffic Distribution for Urban Networks with Answer Set Programming

Answer Set Programming (asp) has demonstrated its potential as an effective tool for concisely representing and reasoning about real-world problems. In this paper, we present an application in which asp has been successfully used in the context of dynamic traffic distribution for urban networks, within a more general framework devised for solving such a real-world problem. In particular, asp has been employed for the computation of the "optimal" routes for all the vehicles in the network. We also provide an empirical analysis of the performance of the whole framework, and of its part in which asp is employed, on two European urban areas, which shows the viability of the framework and the contribution asp can give.