Optimising Dynamic Traffic Distribution for Urban Networks with Answer Set Programming

Matteo Cardellini, Carmine Dodaro, Marco Maratea, Mauro Vallati
8/14/2024
cs.AIcs.LO

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{cardellini2024optimising,
  title  = {Optimising Dynamic Traffic Distribution for Urban Networks with Answer Set Programming},
  author = {Matteo Cardellini and Carmine Dodaro and Marco Maratea and Mauro Vallati},
  year   = {2024},
  eprint = {2408.07521},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.07521v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.07521.svg)](https://codeofpaper.com/paper/2408.07521)

Discussion