Forecast horizon and planning horizon paths in time-indexed network

Stanisław Bylka. "Forecast horizon and planning horizon paths in time-indexed network." Banach Center Publications 71.1 (2006): 63-82. <http://eudml.org/doc/282003>.

@article{StanisławBylka2006,
abstract = {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.},
author = {Stanisław Bylka},
journal = {Banach Center Publications},
keywords = {networks; initial decisions},
language = {eng},
number = {1},
pages = {63-82},
title = {Forecast horizon and planning horizon paths in time-indexed network},
url = {http://eudml.org/doc/282003},
volume = {71},
year = {2006},
}

TY - JOUR
AU - Stanisław Bylka
TI - Forecast horizon and planning horizon paths in time-indexed network
JO - Banach Center Publications
PY - 2006
VL - 71
IS - 1
SP - 63
EP - 82
AB - 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.
LA - eng
KW - networks; initial decisions
UR - http://eudml.org/doc/282003
ER -