Extensions of the Unit Loading Problem

摘要

This paper presents numerical illustrations (and computational time) obtained with a modified dynamic programming alogorithm for the Unit Loading Problem in hydroplant management with constraints on groups of units. Our approach exploits the special structure of the Unit Loading Problem in such a way that the dimension of the state variable and the computational time are greatly reduced. We also present examples of dynamic unit commitment problems solutions.