Bicriterion Shortest Paths in Stochastic Time-Dependent Networks

  • Lars Relund Nielsen
  • Daniele Pretolani
  • Kim Allan Andersen
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 618)


In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path, but rather to a time-adaptive strategy. In some applications, however, it makes good sense to require that the routing policy should correspond to a loopless path in the network, that is, the time-adaptive aspect disappears and a priori route choice is considered.

In this paper we consider bicriterion a priori route choice in STD networks, i.e. the problem of finding the set of efficient paths. Both expectation and min—max criteria are considered and a solution method based on the two-phase method is devised. Experimental results reveal that the full set of efficient solutions can be determined on rather large test instances, which is in contrast to the time-adaptive case.


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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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–399CrossRefGoogle Scholar
  2. 2.
    Cohen J (1978) Multiobjective programming and planning. Academic Press, New YorkGoogle Scholar
  3. 3.
    Gao S, Chabini I (2006) Optimal routing policy problems in stochastic time-dependent networks. Transport Res B 40:93–122CrossRefGoogle Scholar
  4. 4.
    Hall RW (1986) The fastest path through a network with random time-dependent travel times. Transport Sci 20(3):182–188CrossRefGoogle Scholar
  5. 5.
    Hamacher HW, Ruzika S, Tjandra SA (2006) Algorithms for time-dependent bicriteria shortest path problems. Discrete Optim 3:238–254CrossRefGoogle Scholar
  6. 6.
    Miller-Hooks E, Mahmassani HS (1998) Optimal routing of hazardous materials in stochastic, time-varying transportation networks. Transport Res Rec 1645:143–151CrossRefGoogle Scholar
  7. 7.
    Nielsen LR (2004) Route choice in stochastic time-dependent networks. PhD Dissertation, Department of Operations Research, University of Aarhus URL publs?id=499
  8. 8.
    Nielsen LR (2006) Tegp—time-expanded generator with peaks, February 2006. URL Reference manual
  9. 9.
    Nielsen LR, Andersen KA, Pretolani D (2003) Bicriterion shortest hyperpaths in random time-dependent networks. IMA J Manage Math 14(3):271–303CrossRefGoogle Scholar
  10. 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, DenmarkGoogle Scholar
  11. 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, DenmarkGoogle Scholar
  12. 12.
    Opasanon S, Miller-Hooks E (2006) Multicriteria adaptive paths in stochastic time-varying networks. Eur J Oper Res 173:72–91CrossRefGoogle Scholar
  13. 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.CrossRefGoogle Scholar
  14. 14.
    Pretolani D (2000) A directed hypergraph model for random time-dependent shortest paths. Eur J Oper Res 123(2):315–324CrossRefGoogle Scholar
  15. 15.
    Provan JS (2003) A polynomial-time algorithm to find shortest paths with recourse. Networks 41(2):115–125CrossRefGoogle Scholar
  16. 16.
    Warburton A (1987) Approximation of pareto optima in multiple-objective, shortest-path problems. Oper Res 35(1):70–79CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Lars Relund Nielsen
    • 1
  • Daniele Pretolani
    • 2
  • Kim Allan Andersen
    • 3
  1. 1.Department of Genetics and BiotechnologyResearch Unit of Statistics and Decision Analysis, University of AarhusTjeleDenmark
  2. 2.Department of Sciences and Methods of EngineeringUniversity of Modena and Reggio EmiliaReggioItaly
  3. 3.Department of Business StudiesUniversity of AarhusAarhus VDenmark

Personalised recommendations