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

ver descrição completa

Detalhes bibliográficos
Autor principal: Lebedev, D
Outros Autores: Goulart, PJ
Formato: Tese
Idioma:English
Publicado em: 2020
Assuntos: