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...

Deskribapen osoa

Xehetasun bibliografikoak
Egile nagusia: Lebedev, D
Beste egile batzuk: Goulart, PJ
Formatua: Thesis
Hizkuntza:English
Argitaratua: 2020
Gaiak: