Bicriterion shortest paths in stochastic time-dependent networks

Lecture Notes in Economics and Mathematical Systems

Volumn 618, Issue , 2009, Pages 57-67

  Nielsen, Lars Relund ^a   Pretolani, Daniele ^b   Andersen, Kim Allan ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Bicriterion shortest path; Computational analysis; Stochastic time dependent networks; Two phase method

Indexed keywords

EID: 60649093109     PISSN: 00758442     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-85646-7_6     Document Type: Article

References (16)

1. Chang TS, Nozick LK, Turnquist MA (2005) Multiobjective path finding in stochastic dynamic networks, with application to routing hazardous materials shipments. Transport Sci 39(3):383-399
2. Cohen J (1978) Multiobjective programming and planning. Academic Press, New York
3. Gao S, Chabini I (2006) Optimal routing policy problems in stochastic time-dependent networks. Transport Res B 40:93-122
4. Hall RW (1986) The fastest path through a network with random time-dependent travel times. Transport Sci 20(3):182-188
5. Hamacher HW, Ruzika S, Tjandra SA (2006) Algorithms for time-dependent bicriteria shortest path problems. Discrete Optim 3:238-254
6. Miller-Hooks E, Mahmassani HS (1998) Optimal routing of hazardous materials in stochastic, time-varying transportation networks. Transport Res Rec 1645:143-151
7. Nielsen LR (2004) Route choice in stochastic time-dependent networks. PhD Dissertation, Department of Operations Research, University of Aarhus URL http://www.imf,au.dk/publs?id=499
8. Nielsen LR (2006) Tegp - time-expanded generator with peaks, February 2006. URL http://www.research.relund.dk. Reference manual
9. Nielsen LR, Andersen KA, Pretolani D (2003) Bicriterion shortest hyperpaths in random time-dependent networks, IMA J Manage Math 14(3):271-303
10. Nielsen LR, Pretolani D, Andersen KA (2004) K Shortest paths in stochastic time-dependent networks. Working Paper WP-L-2004-05, Department of Accounting, Finance and Logistics, Aarhus School of Business, Denmark.
11. Nielsen LR, Pretolani D, Andersen KA (2006) Bicriterion a priori route choice in stochastic time-dependent networks. Working Paper WP-L-2006-10, Department of Business Studies, Aarhus School of Business, Denmark
12. Opasanon S, Miller-Hooks E (2006) Multicriteria adaptive paths in stochastic time-varying networks. Eur J Oper Res 173:72-91
13. Pedersen CR, Nielsen LR, Andersen KA. The Bicriterion Multi Modal Assignment Problem: Introduction, Analysis, and Experimental Results. Informs Journal on Computing 2008, 20, page 400-411.
14. Pretolani D (2000) A directed hypergraph model for random time-dependent shortest paths. Eur J Oper Res 123(2):315-324
15. Provan JS (2003) A polynomial-time algorithm to find, shortest paths with recourse. Networks 41(2):115-125
16. Warburton. A (1987) Approximation of pareto optima in multiple-objective, shortest-path problems. Oper Res 35(1):70-79