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
フォーマット: 学位論文
言語:English
出版事項: 2020
主題: