Answers are grounded in this paper and cite their sources.
This paper is concerned with the application of a new method to the problem of transmission planning expressed as a large finite Markovian sequential process over time. The method recognizes that in solving large sequential problems the complete enumeration of strategies is seldom feasible. The basic idea of Discrete Dynamic Optimizing (DDO) is to combine the deterministic search procedure of dynamic programming with a probabilistic search and a heuristic stopping criterion. The method is designed to take advantage of whatever information is known about the problem. Test results obtained with an experimental program are also given.
No takes yet. Share an insight, caveat, or question.
Dusonchet et al. (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: