On Convexity of Optimal Multi-Commodity Freeway Network Control

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Sipione, Davide, Como, Giacomo, Nilsson, Gustav
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915691545755648
author Sipione, Davide
Como, Giacomo
Nilsson, Gustav
author_facet Sipione, Davide
Como, Giacomo
Nilsson, Gustav
contents We study a multi-commodity Freeway Network Control (FNC) problem aiming at achieving optimal operation of a transportation network through the use of ramp metering and variable speed limits. Straightforward formulations of both single- and multi-commodity FNC problems based on the Cell Transmission Model are known to be non-convex, mainly due to the congestion effects at diverge junctions. However, recent studies have shown that it is possible to formulate a tight convex relaxation of the single-commodity FNC problem. We extend these results to the multi-commodity FNC problem by considering concave commodity-specific demand functions and concave aggregate supply functions, so that different variable speed limits can be applied to different commodities. Hence, it is possible to efficiently compute the optimal control action to reduce congestion phenomena in the network. We also present a case study of a segment of the freeway network in California, using data from the PeMS database, to demonstrate the effectiveness of the proposed solution. Finally, we draw a comparison with a setting where the multi-commodity flows are modeled and controlled as a single-commodity flow, to emphasize the relevance of acting separately on different classes of vehicles.
format Preprint
id arxiv_https___arxiv_org_abs_2512_19827
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On Convexity of Optimal Multi-Commodity Freeway Network Control
Sipione, Davide
Como, Giacomo
Nilsson, Gustav
Optimization and Control
93
We study a multi-commodity Freeway Network Control (FNC) problem aiming at achieving optimal operation of a transportation network through the use of ramp metering and variable speed limits. Straightforward formulations of both single- and multi-commodity FNC problems based on the Cell Transmission Model are known to be non-convex, mainly due to the congestion effects at diverge junctions. However, recent studies have shown that it is possible to formulate a tight convex relaxation of the single-commodity FNC problem. We extend these results to the multi-commodity FNC problem by considering concave commodity-specific demand functions and concave aggregate supply functions, so that different variable speed limits can be applied to different commodities. Hence, it is possible to efficiently compute the optimal control action to reduce congestion phenomena in the network. We also present a case study of a segment of the freeway network in California, using data from the PeMS database, to demonstrate the effectiveness of the proposed solution. Finally, we draw a comparison with a setting where the multi-commodity flows are modeled and controlled as a single-commodity flow, to emphasize the relevance of acting separately on different classes of vehicles.
title On Convexity of Optimal Multi-Commodity Freeway Network Control
topic Optimization and Control
93
url https://arxiv.org/abs/2512.19827