Teammate: Xinyao Han

With the growth of e-commerce and emerging online shopping platforms such as Amazon Prime, the demand for on-time, direct-to-customer deliveries has been ever increasing. However, customers are usually active at different locations during specific time windows on one day, and are therefore not able to receive packages directly at a fixed location all day long. For companies that would like to add more personalizations, it is important for them to give customers the option to choose the time and location they would like the goods to be handed. We view this problem as a vehicle routing problem, and specifically as a variant with random delivery locations and stochastic travel times. The project aim is to find optimized routes that can significantly maximize the efficiency of the fleet.

We follow the notation in Reyes et al. (2017) and made modifications upon implementation in Julia.

The constraints are listed in the graph above, and more detailed information can be found in the origional paper. Poster for the project can be found below: