A directed hypergraph model for random time dependent shortest paths

European Journal of Operational Research

Volumn 123, Issue 2, 2000, Pages 315-324

  Pretolani, Daniele ^a  

^a UNIVERSITY OF CAMERINO   (Italy)

Author keywords

Directed hypergraphs; Network programming; Random, time dependent, shortest paths

Indexed keywords

GRAPH THEORY; LOCAL AREA NETWORKS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

DIRECTED HYPERGRAPH MODEL; NETWORK PROGRAMMING; RANDOM TIME DEPENDENT SHORTEST PATHS;

MATHEMATICAL MODELS;

EID: 0033894213     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00259-3     Document Type: Article

References (14)

1. D.P. Bertsekas, J.N. Tsitsiklis, An analysis of stochastic shortest path problems, Mathematics of Operation Researchs 16 (3) (1991) 580-595.
2. G. Gallo, G. Longo, S. Nguyen, S. Pallottino, Directed hypergraphs and applications, Discrete Applied Mathematics 42 (1993) 177-201.
3. G. Gallo, S. Pallottino, Hypergraphs Models and Algorithms for the Assembly Problem TR 6/92, Dipartimento di Informatica, Universitá di Pisa, Italy 1992.
4. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, 1978.
5. R.W. Hall, The fastest path through a network with random time-dependent travel times, Transportation Science 20 (3) (1986) 182-188.
6. E.D. Miller-Hooks, Optimal Routing in Time-Varying, Stochastic Networks: Algorithms and Implementations, Ph.D. Dissertation, Department of Civil Engineering, The University of Texas at Austin, August 1997.
7. E.D. Miller-Hooks, H.S. Mahmassani, Least possible time paths in stochastic time-varying networks, Computers and Operations Research 25 (12) (1998) 1107-1125.
8. E.D. Miller-Hooks, H.S. Mahmassani, Optimal routing of hazardous materials in stochastic, time-varying transportation networks, Transportation Research Record, forth-coming.
9. S. Nguyen, S. Pallottino, Hyperpaths and shortest hyperpaths, in: B. Simeone (Ed.), Combinatorial Optimization Lecture Notes in Mathematics, vol. 1403, pp. 258-271.
10. S. Nguyen, S. Pallottino, Equilibrium traffic assignment for large scale transit network, European Journal of Operational Research 37 (1988) 176-186.
11. A. Orda, R. Rom, Shortest-path and minimum delay algorithms in networks with time-dependent edge-length, Journal of ACM 37 (3) (1990) 607-625.
12. A. Orda, R. Rom, Minimum weight paths in time-dependent edge-length, Networks 21 (3) (1991) 295-319.
13. S. Pallottino, M.G. Scutellá, P. Marcotte, S. Nguyen, Shortest path algorithms in transportation models: Classical and innovative aspects, in: P. Marcotte, S. Nguyen (Eds.), Equilibrium and Advanced Transportation Modelling, Kluwer Academic Publishers, Dordrecht, 1998, pp. 245-281.
14. G.H. Polychronopoulos, J.N. Tsitsiklis, Stochastic shortest path problems with recourse, Networks 27 (1996) 133-143.