One-Shot Traffic Assignment with Forward-Looking Penalization

Giuliano Cornacchia, Mirco Nanni, Luca Pappalardo
6/23/2023
cs.MA

No confident code implementation found for this paper.

Abstract

Traffic assignment (TA) is crucial in optimizing transportation systems and consists in efficiently assigning routes to a collection of trips. Existing TA algorithms often do not adequately consider real-time traffic conditions, resulting in inefficient route assignments. This paper introduces METIS, a cooperative, one-shot TA algorithm that combines alternative routing with edge penalization and informed route scoring. We conduct experiments in several cities to evaluate the performance of METIS against state-of-the-art one-shot methods. Compared to the best baseline, METIS significantly reduces CO2 emissions by 18% in Milan, 28\% in Florence, and 46% in Rome, improving trip distribution considerably while still having low computational time. Our study proposes METIS as a promising solution for optimizing TA and urban transportation systems.

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. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

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

Cite this paper

@article{cornacchia2023oneshot,
  title  = {One-Shot Traffic Assignment with Forward-Looking Penalization},
  author = {Giuliano Cornacchia and Mirco Nanni and Luca Pappalardo},
  year   = {2023},
  eprint = {2306.13704},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.13704v1}
}

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/2306.13704.svg)](https://codeofpaper.com/paper/2306.13704)

Discussion