3 papers
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…
cs.DM2025
The Unreliable Job Selection and Sequencing Problem
Alessandro Agnetis, Roel Leus, Emmeline Perneel +1
We study a stochastic single-machine scheduling problem, denoted the Unreliable Job Selection and Sequencing Problem (UJSSP). Given a set of jobs, a subset must be selected for pro…
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.…