73 citations · 77 across the 3 of their papers we have counts for
6 papers
Connected k-Center and k-Diameter Clustering
Lukas Drexler, Jan Eube, Kelin Luo +4
Motivated by an application from geodesy, we introduce a novel clustering problem which is a -center (or k-diameter) problem with a side constraint. For the side constraint, we…
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem
Kelin Luo, Alexandre M. Florio, Syamantak Das +1
Ride-sharing is an essential aspect of modern urban mobility. In this paper, we consider a classical problem in ride-sharing - the Multi-Vehicle Dial-a-Ride Problem (Multi-Vehicle…
Package Delivery Using Drones with Restricted Movement Areas
Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
For the problem of delivering a package from a source node to a destination node in a graph using a set of drones, we study the setting where the movements of each drone are restri…
Solving Large-Scale Dynamic Vehicle Routing Problems with Stochastic Requests
Jian Zhang, Kelin Luo, Alexandre M. Florio +1
Dynamic vehicle routing problems (DVRPs) arise in several applications such as technician routing, meal delivery, and parcel shipping. We consider the DVRP with stochastic customer…
Online Food Delivery to Minimize Maximum Flow Time
Xiangyu Guo, Shi Li, Kelin Luo +1
We study a common delivery problem encountered in nowadays online food-ordering platforms: Customers order dishes online, and the restaurant delivers the food after receiving the o…
Approximation algorithms for car-sharing problems
Kelin Luo, Frits C. R. Spieksma
We consider several variants of a car-sharing problem. Given are a number of requests each consisting of a pick-up location and a drop-off location, a number of cars, and nonnegati…