Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
Cohen J (1978) Multiobjective programming and planning. Academic Press, New York
Gao S, Chabini I (2006) Optimal routing policy problems in stochastic time-dependent networks. Transport Res B 40:93–122
Hall RW (1986) The fastest path through a network with random time-dependent travel times. Transport Sci 20(3):182–188
Hamacher HW, Ruzika S, Tjandra SA (2006) Algorithms for time-dependent bicriteria shortest path problems. Discrete Optim 3:238–254
Miller-Hooks E, Mahmassani HS (1998) Optimal routing of hazardous materials in stochastic, time-varying transportation networks. Transport Res Rec 1645:143–151
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
Nielsen LR (2006) Tegp—time-expanded generator with peaks, February 2006. URL http://www.research.relund.dk. Reference manual
Nielsen LR, Andersen KA, Pretolani D (2003) Bicriterion shortest hyperpaths in random time-dependent networks. IMA J Manage Math 14(3):271–303
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
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
Opasanon S, Miller-Hooks E (2006) Multicriteria adaptive paths in stochastic time-varying networks. Eur J Oper Res 173:72–91
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.
Pretolani D (2000) A directed hypergraph model for random time-dependent shortest paths. Eur J Oper Res 123(2):315–324
Provan JS (2003) A polynomial-time algorithm to find shortest paths with recourse. Networks 41(2):115–125
Warburton A (1987) Approximation of pareto optima in multiple-objective, shortest-path problems. Oper Res 35(1):70–79
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nielsen, L.R., Pretolani, D., Andersen, K.A. (2009). Bicriterion Shortest Paths in Stochastic Time-Dependent Networks. In: Barichard, V., Ehrgott, M., Gandibleux, X., T'Kindt, V. (eds) Multiobjective Programming and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol 618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85646-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-85646-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85645-0
Online ISBN: 978-3-540-85646-7
eBook Packages: Business and EconomicsBusiness and Management (R0)