Related papers: Incorporating Service Reliability in Multi-depot V…
Next-day delivery logistics services are redefining the industry by increasingly focusing on customer service. A challenge each logistics service provider faces is to jointly optimize time window assignment and vehicle routing for such…
This paper introduces a novel approach for jointly solving the periodic Train Timetabling Problem (TTP), train routing, and Vehicle Circulation Problem (VCP) through a unified optimization model. While these planning stages are…
This study presents optimization problems to jointly determine long-term network design, mid-term fleet sizing strategy, and short-term routing and ridesharing matching in shared autonomous vehicle (SAV) systems with pre-booked and…
The Multiple Depot Ring-Star Problem (MDRSP) is an important combinatorial optimization problem that arises in the context of optical fiber network design, and in applications pertaining to collecting data using stationary sensing devices…
Due to increasing railway use, the capacity at railway yards and maintenance locations is becoming limiting. Therefore, the scheduling of rolling stock maintenance and the choice regarding optimal locations to perform maintenance is…
Truckload procurement plays a vital role in integrated container logistics, particularly under the uncertainties of container flow and market conditions. We formulate the operational volume allocation problem in drayage procurement as a…
The Multiple-Depot Split Delivery Vehicle Routing Problem (MD-SDVRP) is a challenging problem with broad applications in logistics. The goal is to serve customers' demand using a fleet of capacitated vehicles located in multiple depots,…
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…
Provably safe and scalable multi-vehicle trajectory planning is an important and urgent problem. Hamilton-Jacobi (HJ) reachability is an ideal tool for analyzing such safety-critical systems and has been successfully applied to several…
Addressing the Integrated Timetabling and Vehicle Scheduling (TTVS) problem is important for improving transit operations. Recently, the emerging modular autonomous vehicles composed of modular autonomous units have made it possible to…
We introduce the multimodal car- and ride-sharing problem (MMCRP), in which a pool of cars is used to cover a set of ride requests while uncovered requests are assigned to other modes of transport (MOT). A car's route consists of one or…
This article proposes and evaluates a new safety concept called backup plan safety for path planning of autonomous vehicles under mission uncertainty using model predictive control (MPC). Backup plan safety is defined as the ability to…
We study a stochastic variant of the vehicle routing problem arising in the context of domestic donor collection services. The problem we consider combines the following attributes. Customers requesting services are variable, in the sense…
The multi-vehicle covering tour problem with time windows (MCTPTW) aims to construct a set of maximal coverage routes for a fleet of vehicles that serve (observe) a secondary set of sites given a fixed time schedule, coverage requirements,…
With an increasing need for more flexible mobility services, we consider an operational problem arising in the planning of Demand Adaptive Systems (DAS). Motivated by the decision of whether to accept or reject passenger requests in real…
Vehicular cloud (VC) is a promising technology for processing computation-intensive applications (CI-Apps) on smart vehicles. Implementing VCs over the network edge faces two key challenges: (C1) On-board computing resources of a single…
Public transit systems are the backbone of urban mobility systems in the era of urbanization. The design of transit schedules is important for the efficient and sustainable operation of public transit. However, previous studies usually…
Multi-Agent Pickup and Delivery (MAPD) is the problem of computing collision-free paths for a group of agents such that they can safely reach delivery locations from pickup ones. These locations are provided at runtime, making MAPD a…
We propose two distributionally robust optimization (DRO) models for a mobile facility (MF) fleet sizing, routing, and scheduling problem (MFRSP) with time-dependent and random demand, as well as methodologies for solving these models.…
The Vehicle Routing Problem with pickups, deliveries and spatiotemporal service constraints ($VRPPDSTC$) is a quite challenging algorithmic problem that can be dealt with in either an offline or an online fashion. In this work, we focus on…