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

Description complète

Détails bibliographiques
Auteur principal: Lebedev, D
Autres auteurs: Goulart, PJ
Format: Thèse
Langue:English
Publié: 2020
Sujets: