Related papers: An Equilibrium Dynamic Traffic Assignment Model wi…
We consider a discrete population of users with homogeneous service demand who need to decide when to arrive to a system in which the service rate deteriorates linearly with the number of users in the system. The users have heterogeneous…
In recent years, we have witnessed a remarkable surge of usage in shared vehicles in our cities. Shared mobility offers a future of no congestion in busy city roads with increasing populations of travelers, passengers, and drivers. Given…
We propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special type. We propose some kind of "algebra" on different models and corresponding…
The Traffic Assignment Problem is a fundamental, yet computationally expensive, task in transportation modeling, especially for large-scale networks. Traditional methods require iterative simulations to reach equilibrium, making real-time…
The objective of this paper is to initiate a qualitative analysis of dynamic flow in traffic networks by using the competitive equilibrium model of multiple market systems. A network is modeled as a dynamic graph where routes (edges) are…
Consider a distribution of citizens in an urban area in which some services (supermarkets, post offices...) are present. Each citizen, in order to use a service, spends an amount of time which is due both to the travel time to the service…
Traffic assignment is a core component of many urban transport planning tools. It is used to determine how traffic is distributed over a transportation network. We study the task of computing traffic assignments for public transport: Given…
In the regime of bounded transportation costs, additive approximations for the optimal transport problem are reduced (rather simply) to relative approximations for positive linear programs, resulting in faster additive approximation…
Urban traffic congestion remains a persistent issue for cities worldwide. Recent macroscopic models have adopted a mathematically well-defined relation between network flow and density to characterize traffic states over an urban region.…
Dynamic user equilibrium (DUE) is the most widely studied form of dynamic traffic assignment, in which road travelers engage in a non-cooperative Nash-like game with departure time and route choices. DUE models describe and predict the…
Optimal transport is a framework that facilitates the most efficient allocation of a limited amount of resources. However, the most efficient allocation scheme does not necessarily preserve the most fairness. In this paper, we establish a…
We propose an optimal solution to a deterministic dynamic assignment problem by leveraging connections to the theory of discrete optimal transport to convert the combinatorial assignment problem into a tractable linear program. We seek to…
The residual queue during a given study period (e.g., peak hour) is an important feature that should be considered when solving a traffic assignment problem under equilibrium for strategic traffic planning. Although studies have focused…
In this paper, we present a cyclically time-expanded network model for simultaneous optimization of traffic assignment and traffic signal parameters, in particular offsets, split times, and phase orders. Since travel times are of great…
We initiate the study of dynamic traffic assignment for electrical vehicles addressing the specific challenges such as range limitations and the possibility of battery recharge at predefined charging locations. We pose the dynamic…
Within a decade, almost every major auto company, along with fleet operators such as Uber, have announced plans to put autonomous vehicles on the road. At the same time, electric vehicles are quickly emerging as a next-generation technology…
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…
This paper considers the dispatching of large-scale real-time ride-sharing systems to address congestion issues faced by many cities. The goal is to serve all customers (service guarantees) with a small number of vehicles while minimizing…
A system manager makes dynamic pricing and dispatch control decisions in a queueing network model motivated by ride-hailing applications. A novel feature of the model is that it incorporates travel times. Unfortunately, this renders the…
It is commonly seen that buses are blocked by the ones in front serving passengers and have to queue outside a curbside bus stop although there are vacant berths at the stop. The resultant bus delays degrade the service level of urban…