Problem Setting

Overview

• Concept: Similar to the first contest, the contestant will run a delivery service. Customers will place orders with the contestant shop. Each order has a unique $\\text{ID}$ and should be delivered to the corresponding customer. The contestant's delivery service has one car. The car will fetch the ordered item from the shop and deliver it to the customer.
• Score: The goal is to deliver as many items as possible, as quickly as possible in a given amount of time $T_{\\text{max}}$. (Orders are expected until $0.95 \\times T_{\\text{max}}$).
• Constraint: In this contest there is no constraint on the number of items which can be placed into the car. However, an item can only be loaded in the car, by fetching it from the shop, after the order has been placed.
• Problem C: In this problem orders appear online, that is new orders appear, while the contestant moves the car to make as many deliveries as possible as fast as possible. In addition the planning algorithm of the service will have to master several environmental uncertainties which constitute the main difference from our previous contest.
• New: