In this paper a two-stage algorithm for finding non- dominated subsets of partially ordered sets is established. A connection is then made with dimension reduction in time-dependent dynamic programming via the notion of a bounding label, a function that bounds the state-transition cost functions. In this context, the computational burden is partitioned between a time-independent dynamic programming step carried out on the bounding label and a direct evaluation carried out on a subset of “real” valued...
The Algorithm in this paper is designed to find the
shortest path in a network given time-dependent cost functions. It has
the following features: it is recursive; it takes place bath in a
backward dynamic programming phase and in a forward evaluation phase; it
does not need a time-grid such as in Cook and Halsey and Kostreva and
Wiecek's "Algorithm One”; it requires only boundedness (above and
below) of the cost functions; it reduces to backward multi-objective
dynamic programming if there are...
In this paper a two-stage algorithm for finding non-
dominated subsets of partially ordered sets
is established. A connection is then made with dimension reduction in time-dependent
dynamic programming the notion of a bounding label, a function that bounds
the state-transition cost functions. In this context, the computational burden is partitioned
between a time-independent dynamic programming step carried out on the bounding label and
a direct evaluation carried out on a subset of “real" valued...
Download Results (CSV)