Related papers: Arc travel time and path choice model estimation s…
We consider the problem of finding an optimal history-dependent routing strategy on a directed graph weighted by stochastic arc costs when the objective is to minimize the risk of spending more than a prescribed budget. To help mitigate the…
We consider the problem of choosing a subset of proposed road network upgrades to implement within a fixed budget in order to optimize the benefit in terms of vehicle hours travelled (VHT), and show how to render the solution of this…
Travel time estimation is one of the core tasks for the development of intelligent transportation systems. Most previous works model the road segments or intersections separately by learning their spatio-temporal characteristics to estimate…
Line planning in public transport is the strategic problem of selecting lines and their operating frequencies. This problem is important as it defines the passenger service, based on available connections and expected travel times, and…
Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention.…
The potential of an efficient ride-sharing scheme to significantly reduce traffic congestion, lower emission level, as well as facilitating the introduction of smart cities has been widely demonstrated. This positive thrust however is faced…
We develop a method to estimate from data travel latency cost functions in multi-class transportation networks, which accommodate different types of vehicles with very different characteristics (e.g., cars and trucks). Leveraging our…
Dynamic low altitude networks offer significant potential for efficient and reliable data transport via unmanned aerial vehicles (UAVs) relays which usually operate with predetermined trajectories. However, it is challenging to optimize the…
Based on the reliability budget and percentile travel time (PTT) concept, a new travel time index named combined mean travel time (CMTT) under stochastic traffic network was proposed. CMTT here was defined as the convex combination of the…
An approach for mapping an electric vehicle EV driver s travel time constraints and risk taking behavior to real time routing in a probabilistic time-dependent or stochastic network is proposed in this paper. The proposed approach is based…
We study persistent query evaluation over streaming graphs, which is becoming increasingly important. We focus on navigational queries that determine if there exists a path between two entities that satisfies a user-specified constraint. We…
This paper proposes an approach to perform travel demand calibration for high-resolution stochastic traffic simulators. It employs abundant travel times at the path-level, departing from the standard practice of resorting to scarce…
In this letter, we consider a transportation network with a 100\% penetration rate of connected and automated vehicles (CAVs) and present an optimal routing approach that takes into account the efficiency achieved in the network by…
We consider the problem of assigning appearing times to the edges of a digraph in order to maximize the (average) temporal reachability between pairs of nodes. Motivated by the application to public transit networks, where edges cannot be…
Introducing Internet traffic anomaly detection mechanism based on large deviations results for empirical measures. Using past traffic traces we characterize network traffic during various time-of-day intervals, assuming that it is…
In this paper, we propose Multi-Rate Bandwidth Available in Real Time (MR-BART) to estimate the end-to-end Available Bandwidth (AB) of a network path. The proposed scheme is an extension of the Bandwidth Available in Real Time (BART) which…
Parallel real-time systems (e.g., autonomous driving systems) often contain functionalities with complex dependencies and execution uncertainties, leading to significant timing variability which can be represented as a probabilistic…
The Tourist Trip Design Problem aims to prescribe a sightseeing plan that maximizes tourist satisfaction while taking into account a multitude of parameters and constraints, such as the distances among points of interest, the expected…
Route choice is often modelled as a two-step procedure in which travellers choose their routes from small sets of promising candidates. Many methods developed to identify such choice sets rely on assumptions about the mechanisms behind the…
This paper considers theoretical solutions for path planning problems under non-probabilistic uncertainty used in the travel salesman problems under uncertainty. The uncertainty is on the paths between the cities as nodes in a travelling…