Related papers: The 1-Center and 1-Highway problem
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…
A fundamental problem in traffic networks is driving under safety and limited physical space constraints. In this paper, we design longitudinal vehicle controllers and study the dynamics of a system of homogeneous vehicles on a single-lane…
Planning scholars have identified economic, safety, and social benefits of converting one-way streets to two-way. Less is known about how conversions could impact vehicular distances traveled - of growing relevance in an era of fleet…
Particle transport through an open, discrete 1-D channel against a mechanical or chemical bias is analyzed within a master equation approach. The channel, externally driven by time dependent site energies, allows multiple occupation due to…
We consider the $k$-Center problem and some generalizations. For $k$-Center a set of $k$ center vertices needs to be found in a graph $G$ with edge lengths, such that the distance from any vertex of $G$ to its nearest center is minimized.…
In this thesis, Riemann problems and Godunov methods are developed for higher order traffic flow models. A rigorous analysis of the first order traffic flow model of inhomogeneous road is presented. A two-level simulation framework of…
We report the first analytical calculation of the distribution of the time headways in some special cases of a particle-hopping model of vehicular traffic on idealized single-lane highways and compare with the corresponding results of our…
The capacitated p-center problem requires to select p facilities from a set of candidates to service a number of customers, subject to facility capacity constraints, with the aim of minimizing the maximum distance between a customer and its…
Urban traffic is a logistic issue which can have many societal implications, especially when, due to a too high density of cars, the network of streets of a city becomes blocked, and consequently, pedestrians, bicycles, and cars start…
We study completely asymmetric 2-channel exclusion processes in 1 dimension. It describes a two-way traffic flow with cars moving in opposite directions. The interchannel interaction makes cars slow down in the vicinity of approaching cars…
Initially a car is placed with probability p at each site of the two-dimensional integer lattice. Each car is equally likely to be East-facing or North-facing, and different sites receive independent assignments. At odd time steps, each…
Facility location problems often permit facilities to be located at any position. But what if this is not the case in practice? What if facilities can only be located at particular locations like a highway exit or close to a bus stop? We…
Setting traffic light signals is a classical topic in traffic engineering, and important in heavy-traffic conditions when green times become scarce and longer queues are inevitably formed. For the fixed-cycle traffic-light queue, an…
In this paper we study a dynamic vehicle routing problem in which there are multiple vehicles and multiple classes of demands. Demands of each class arrive in the environment randomly over time and require a random amount of on-site service…
The increasing urbanization process we have been witnessing in the last decades is accompanied by a significant increase in traffic congestion in cities around the world. The effect of the congestion is represented in the enormous time…
We consider a stylized formal model of public transportation, where a set of agents need to travel along a given road, and there is a bus that runs the length of this road. Each agent has a left terminal and a right terminal between which…
We give a rigorous solution of an optimisation problem of minimizing the expected delay caused by encountering a red traffic light on a road journey. The problem incorporates simple constraints on maximum speed, acceleration and braking…
Traditional car-sharing services are based on the two-way scheme, where the user picks up and returns the vehicle at the same parking station. Some services permits also one-way trips, which allows the user to return the vehicle in another…
In modern fulfillment warehouses, agents traverse the map to complete endless tasks that arrive on the fly, which is formulated as a lifelong Multi-Agent Path Finding (lifelong MAPF) problem. The goal of tackling this challenging problem is…
We study an admissions control problem, where a queue with service rate $1-p$ receives incoming jobs at rate $\lambda\in(1-p,1)$, and the decision maker is allowed to redirect away jobs up to a rate of $p$, with the objective of minimizing…