Related papers: Optimizing Curbside Parking Resources Subject to C…
Transport in crowded, complex environments occurs across many spatial scales. Geometric restrictions can hinder the motion of individuals and, combined with crowding between individuals, can have drastic effects on global transport…
In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it…
In this research a continuous model for resource allocations in a queuing system is considered and a local prediction on the system behavior is developed. As a result we obtain a set of possible cases, some of which lead to quite clear…
In this paper we study a revenue maximization problem for optical routing nodes. We model the routing node as a single server polling model with the aim to assign visit periods (service windows) to the different stations (ports) such that…
During the last decade bike sharing systems have emerged as a public transport mode in urban short trips in more than 500 major cities around the world. For the mobility service mode, many challenges from its operations are not well…
Performance analysis of queueing networks is one of the most challenging areas of queueing theory. Barring very specialized models such as product-form type queueing networks, there exist very few results which provide provable…
Spurred by the growth of transportation network companies and increasing data capabilities, vehicle routing and ride-matching algorithms can improve the efficiency of private transportation services. However, existing routing solutions do…
Parking spaces are resources that can be pooled together and shared, especially when there are complementary day-time and night-time users. We answer two design questions. First, given a quality of service requirement, how many spaces…
The conventional view of the congestion control problem in data networks is based on the principle that a flow's performance is uniquely determined by the state of its bottleneck link, regardless of the topological properties of the…
Rapid urbanization places increasing stress on already burdened transportation systems, resulting in delays and poor levels of service. Billions of spatiotemporal call detail records (CDRs) collected from mobile devices create new…
In this paper, we consider the service caching and the computing resource allocation in edge computing (EC) enabled networks. We introduce a random service caching design considering multiple types of latency sensitive services and the base…
The advent of shared-economy and smartphones made on-demand transportation services possible, which created additional opportunities, but also more complexity to urban mobility. Companies that offer these services are called Transportation…
In the freeway network control (FNC) problem, the operation of a traffic network is optimized using only flow control. For special cases of the FNC problem, in particular the case when all merging flows are controlled, there exist tight…
Stochastic matching is the stochastic version of the well-known matching problem, which consists in maximizing the rewards of a matching under a set of probability distributions associated with the nodes and edges. In most stochastic…
We analyze analytically the effect of congestion costs within a physically relevant, yet exactly solvable network model featuring central hubs. These costs lead to a competition between centralized and decentralized transport pathways. In…
Congestion emerges when high demand peaks put transportation systems under stress. Understanding the interplay between the spatial organization of demand, the route choices of citizens, and the underlying infrastructures is thus crucial to…
In the vision of urban air mobility, air transport systems serve the demands of urban communities by routing flight traffic in networks formed by vertiports and flight corridors. We develop a routing algorithm to ensure that the air traffic…
We consider ride-sharing networks served by human-driven vehicles (HVs) and autonomous vehicles (AVs). We propose a model for ride-sharing in this mixed autonomy setting for a multi-location network in which a ride-sharing platform sets…
We consider a given region $\Omega$ where the traffic flows according to two regimes: in a region $C$ we have a low congestion, where in the remaining part $\Omega\setminus C$ the congestion is higher. The two congestion functions $H_1$ and…
We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates…