3 papers
eess.SY2026
New Formulations and Discretization Insights for the Electric Autonomous Dial-a-Ride Problem
Boshuai Zhao, Adam Abdin, Jakob Puchinger
The Electric Autonomous Dial-a-Ride Problem (E-ADARP) involves routing and scheduling electric autonomous vehicles under battery capacity and partial recharging constraints, aiming…
econ.TH2026
The Dial-a-Ride Problem with Synchronized Visits
Boshuai Zhao, Jakob Puchinger, Roel Leus
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…
econ.TH2025
The Dial-a-Ride Problem with Limited Pickups per Trip
Boshuai Zhao, Kai Wang, Wenchao Wei +1
The Dial-a-Ride Problem (DARP) is an optimization problem that involves determining optimal routes and schedules for several vehicles to pick up and deliver items at minimum cost.…