Approximate dynamic programming for revenue management in attended home delivery

We consider the problem of finding profit-maximising prices for delivery time slots in the context of attended home delivery. This is a multi-stage optimal control problem that admits a dynamic programming formulation. However, this formulation is intractable for realistic problem sizes due to the s...

Szczegółowa specyfikacja

Opis bibliograficzny
1. autor: Lebedev, D
Kolejni autorzy: Goulart, PJ
Format: Praca dyplomowa
Język:English
Wydane: 2020
Hasła przedmiotowe: