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

תיאור מלא

מידע ביבליוגרפי
מחבר ראשי: Lebedev, D
מחברים אחרים: Goulart, PJ
פורמט: Thesis
שפה:English
יצא לאור: 2020
נושאים: