The problem of existence of a forecast (or planning) horizon has been considered in many special models, more or less precisely. We specify and investigate this problem for families of cheapest paths in networks with weakly ordered nodes. In a discrete network, the standard forward algorithm finds the subnetwork generated by optimal paths. The proposed forward procedure reduces subnetworks such that the forecast horizon remains unchanged. Based on the final subnetwork, we have an answer to the forecast horizon questions. In particular, we show that many questions about rationality of initial decisions become NP-hard. To improve the performance of heuristics, we introduce the notion of potentially rational initial decisions.
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-bc71-0-5,
author = {Stanis\l aw Bylka},
title = {Forecast horizon and planning horizon paths in time-indexed network},
journal = {Banach Center Publications},
volume = {72},
year = {2006},
pages = {63-82},
zbl = {1115.90031},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-bc71-0-5}
}
Stanisław Bylka. Forecast horizon and planning horizon paths in time-indexed network. Banach Center Publications, Tome 72 (2006) pp. 63-82. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-bc71-0-5/