2011
DOI: 10.1016/j.cie.2011.01.007
|View full text |Cite
|
Sign up to set email alerts
|

Approximate dynamic programming for an inventory problem: Empirical comparison

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
10
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 32 publications
0
10
0
Order By: Relevance
“…A '*' marks an average aggregate cost and line beside it represents a 90% confidence interval, based on t-test statistics. On the y-axis, labels 'H', 'S', 'SL', 'RG', and 'DCB', and 'Roll' indicate results obtained from the 12-period Look-Ahead, Sarsa, Sarsa(λ), RG, and the DCB method, respectively 4 . The Roll-out method was used with perfect system information: Rollout simulation parameter values match those of the actual problem.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…A '*' marks an average aggregate cost and line beside it represents a 90% confidence interval, based on t-test statistics. On the y-axis, labels 'H', 'S', 'SL', 'RG', and 'DCB', and 'Roll' indicate results obtained from the 12-period Look-Ahead, Sarsa, Sarsa(λ), RG, and the DCB method, respectively 4 . The Roll-out method was used with perfect system information: Rollout simulation parameter values match those of the actual problem.…”
Section: Resultsmentioning
confidence: 99%
“…RBF has three sets of parameters: centers, scales, and weights. RBF centers and scales are set up asKatanyukul et al (2011). RBF weights are adjustable parameters whose values are determined by the method under investigated.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…More recently, Pratikakis (2008) suggested a real-time ADP approach based on nonparametric k-nearest neighbor scheme for the value function approximation; it was applied to a high dimensional light aromatic supply chain example. Other studies dealing with inventory problems through ADP are well listed in Katanyukul, Duff, and Chong (2011); however, the usefulness of ADP has not been fully explored in the process systems engineering community.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Most of the ADP or NDP algorithms explained in those books and the review, however, are not for UMDP's but for finite-horizon or discounted MDP's. Katanyukul et al (2011) compared the learning-based and simulation-based approximate dynamic programming methods for finite-horizon inventory problems with demand forecasts and concluded that the simulation-based rollout method provides better performance. Desai et al (2012) proposed the smoothed approximate linear program for discounted MDP's and applied to the game of Tetris and a queuing network control problem.…”
Section: Introductionmentioning
confidence: 98%