.png){kind=icon}
Return
A directed hypergraph model for random time dependent shortest paths
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00259-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider routing problems in dynamic networks where are travel times are both random and time dependent. The problem of finding the best route to a fixed destination is formulated in terms of shortest hyperpaths on a suitable time-expanded directed hypergraph. The latter problem can be solved in linear time, with respect to the size of the hypergraph, for several definitions of hyperpath length. Different criteria for ranking routes can be modeled by suitable definitions of hyperpath length. We also show that the problem becomes intractable if a constraint on the route structure is imposed. (C) 2000 Elsevier Science B.V. All rights reserved.
Keywords:
network programming
random, time-dependent, shortest paths
directed hypergraphs
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
ShareSaveVitamin D Status Does Not Affect Disability Progression of Patients with Multiple Sclerosis over Three Year Follow-Up.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSaveShareSave
ShareSaveShareSaveShareSave no more
no more