Related papers: Event-based MILP models for ride pooling applicati…

This article describes the methodology for formulating and solving optimal pump scheduling problems with variable-speed pumps (VSPs) as mixed integer linear programs (MILPs) using piece-linear approximations of the network components. The…

Microtransit offers a promising blend of rideshare flexibility and public transit efficiency. In practice, it faces unanticipated but spatially aligned requests, passengers seeking to join ongoing schedules, leading to underutilized…

We present new models of optimization-based task and motion planning (TAMP) for robotic pick-and-place (P&P), which plan action sequences and motion trajectory with low computational costs. We improved an existing state-of-the-art TAMP…

Carpooling, or sharing a ride with other passengers, holds immense potential for urban transportation. Ridesharing platforms enable such sharing of rides using real-time data. Finding ride matches in real-time at urban scale is a difficult…

Mobility-on-Demand (MoD) services have been an active research topic in recent years. Many studies focused on developing control algorithms to supply efficient services. To cope with a large search space to solve the underlying vehicle…

Real-time vehicle dispatching operations in traditional car-sharing systems is an already computationally challenging scheduling problem. Electrification only exacerbates the computational difficulties as charge level constraints come into…

We propose Hyper-pool, an analytical, offline, utility-driven ride-pooling algorithm to aggregate individual trip requests into attractive shared rides of high-occupancy. We depart from our ride-pooling ExMAS algorithm where single rides…

We study a routing and appointment scheduling problem with uncertain service and travel times arising from home service practice. Specifically, given a set of customers within a service region that an operator needs to serve, we seek to…

In this paper, we propose a novel, computational efficient, dynamic ridesharing algorithm. The beneficial computational properties of the algorithm arise from casting the ridesharing problem as a linear assignment problem between fleet…

Finding optimal join orders is among the most crucial steps to be performed by query optimisers. Though extensively studied in data management research, the problem remains far from solved: While query optimisers rely on exhaustive search…

We address the optimal design of a large scale multi-agent system where each agent has discrete and/or continuous decision variables that need to be set so as to optimize the sum of linear local cost functions, in presence of linear local…

Increasingly volatile electricity prices make simultaneous scheduling optimization desirable for production processes and their energy systems. Simultaneous scheduling needs to account for both process dynamics and binary on/off-decisions…

Ride sharing services combine trips of multiple users in the same vehicle and may provide more sustainable transport than private cars. As mobility demand varies during the day, the travel times experienced by passengers may substantially…

The shift from private vehicles to public and shared transport is crucial to reducing emissions and meeting climate targets. Consequently, there is an urgent need to develop a multimodal transport trip planning approach that integrates…

This study introduces the Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows (TD-DMPVRPTW), motivated by a real-world application at a food company's distribution center. This problem deals with the design…

Recent studies and industry advancements indicate that modular vehicles (MVs) have the potential to enhance transportation systems through their ability to dock and split during a trip. Although various applications of MVs have been…

The limited capacity of drones and future one- or two-seat modular vehicles requires multiple units to serve a single large customer (i.e., a customer whose demand exceeds a single vehicle's capacity) simultaneously, whereas small customers…

This paper considers the dispatching of large-scale real-time ride-sharing systems to address congestion issues faced by many cities. The goal is to serve all customers (service guarantees) with a small number of vehicles while minimizing…

We present a unified framework for minimizing average completion time for many seemingly disparate online scheduling problems, such as the traveling repairperson problems (TRP), dial-a-ride problems (DARP), and scheduling on unrelated…

As large scale deployment of smart devices in the power grid continues, research efforts need to increasingly focus on efficient communication of generated information. This paper describes a strategy for static routing and scheduling of…