The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest
to many researchers from mathematics, economics, and computer science. Manifold TSP …

Online Delivery Platforms (ODPs) have revolutionised the delivery of restaurant-prepared
food. There is a need for a systematic identification and classification of the problems …

We consider a variant of the offline Dial-a-Ride problem on weighted graphs with a single
server where each request has a source and destination. The server's goal is to serve …

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 …

We study a common delivery problem encountered in nowadays online food-ordering
platforms: Customers order dishes online, and the restaurant delivers the food after …

When given incomplete information, an algorithm trying to solve a problem needs to resort to
a heuristic to guide the choices in what is hopefully the right direction. This paper examined …

In this study, we focus on the problem of online bottleneck matching on a star graph. Given
m servers fixed on m leaf nodes on the star graph, m requests arrive one by one in an online …