Author： Getachew Teodros Kostreva Michael Lancaster Laura
Publisher： Edp Sciences
E-ISSN： 1290-3868|34|1|27-47
ISSN： 0399-0559
Source： RAIRO - Operations Research, Vol.34, Iss.1, 2010-03, pp. : 27-47
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
The Algorithm in this paper is designed to find theshortest path in a network given time-dependent cost functions. It hasthe following features: it is recursive; it takes place bath in abackward dynamic programming phase and in a forward evaluation phase; itdoes not need a time-grid such as in Cook and Halsey and Kostreva andWiecek's "Algorithm One”; it requires only boundedness (above andbelow) of the cost functions; it reduces to backward multi-objectivedynamic programming if there are constant costs. This algorithm has beensuccessfully applied to multi-stage decision problems where the costsare a function of the time when the decision is made. There are examplesof further applications to tactical delay in production scheduling andto production control.
Related content
Optimization of hydraulic modes of distribution heat networks by dynamic programming
E3S Web of conferences, Vol. 39, Iss. issue, 2018-06 ,pp. :
Access to resources
Recommend
Dynamic control of infrastructural networks
International Journal of Critical Infrastructures, Vol. 8, Iss. 2-3, 2012-09 ,pp. :
Access to resources
A survey on combinatorial optimization in dynamic environments
By Boria Nicolas Paschos Vangelis T.
RAIRO - Operations Research, Vol. 45, Iss. 3, 2011-12 ,pp. :
Dynamic Optimization for Vortex Shedding Suppression
MATEC Web of conference, Vol. 41, Iss. issue, 2016-02 ,pp. :