Related papers: Column Generation for the Micro-Transit Zoning Pro…
This paper aims to introduce a mathematical model to solve the time-dependent electric vehicles routing problem in shared travels. Shared mobility has gained significance recently due to its contribution to the alleviation of traffic…
This article proposes an efficient heuristic in accelerating the column generation by parallel resolution of pricing problems for aircrafts in the tail assignment problem (TAP). The approach is able to achieve considerable improvement in…
In this work, a graph partitioning problem in a fixed number of connected components is considered. Given an undirected graph with costs on the edges, the problem consists of partitioning the set of nodes into a fixed number of subsets with…
This paper studies the estimation of ranked-list discrete choice models with single and multiple purchases. In this setting, each consumer type is characterized by a ranking over a subset of products and a desired number of purchases, and…
In the field of telecommunications, various operations are driven by different physical quantities. Each has its own patterns in time and space, but all show some clustered structures in their spatial distribution. This reflects a unified…
We consider the problem of coordinating a fleet of robots in a warehouse so as to maximize the reward achieved within a time limit while respecting problem and robot specific constraints. We formulate the problem as a weighted set packing…
Motivated by the computational difficulties incurred by popular deep learning algorithms for the generative modeling of temporal densities, we propose a cheap alternative which requires minimal hyperparameter tuning and scales favorably to…
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 pursuit of higher energy efficiency in computer networks, one subfield of green traffic engineering aims at reducing the size of a network during times of low traffic, while still guaranteeing the ability to route all occurring demands.…
We introduce the batched set cover problem, which is a generalization of the online set cover problem. In this problem, the elements of the ground set that need to be covered arrive in batches. Our main technical contribution is a tight…
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 consider joint caching, routing, and channel assignment for video delivery over coordinated small-cell cellular systems of the future Internet. We formulate the problem of maximizing the throughput of the system as a linear program in…
Min-max routing problems aim to minimize the maximum tour length among multiple agents by having agents conduct tasks in a cooperative manner. These problems include impactful real-world applications but are known as NP-hard. Existing…
Microtransit and other flexible transit fleet services can reduce costs by incorporating transfers. However, transfers are costly to users if they must get off a vehicle and wait at a stop for another pickup. A mixed integer linear…
Public-transit systems face a number of operational challenges: (a) changing ridership patterns requiring optimization of fixed line services, (b) optimizing vehicle-to-trip assignments to reduce maintenance and operation codes, and (c)…
Learning the embeddings for urban regions from human mobility data can reveal the functionality of regions, and then enables the correlated but distinct tasks such as crime prediction. Human mobility data contains rich but abundant…
Traffic congestion is one of the most notable problems arising in worldwide urban areas, importantly compromising human mobility and air quality. Current technologies to sense real-time data about cities, and its open distribution for…
Big, transport-related datasets are nowadays publicly available, which makes data-driven mobility analysis possible. Trips with their origins, destinations and travel times are collected in publicly available big databases, which allows for…
We propose a joint model that links the strategic level location and capacity decisions with the operational level routing and hub assignment decisions to solve hub network design problem with congestion and heterogeneous economics of…
We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide…